- dijkstra's algorithm
下載手機(jī)詞典可隨時(shí)隨地查詞查翻譯
dijkstra算法的英文
例句與用法
- 更多例句： 下一頁(yè)
- Anthinetic of dijkstra yield an effective way to solve this question
Dijkstra算法為解決這類問題提供了一種很好的算法。 - Finally i implement two location model with common di jkstra algorithm and stimulation annealing merged with gas , at the same time i give out some experiment datas and the idea of algorithm
最后對(duì)兩類選地址模型分別用傳統(tǒng)的dijkstra算法和模擬退火遺傳混合算法實(shí)現(xiàn)，并給出相應(yīng)的實(shí)驗(yàn)數(shù)據(jù)和算法思想。 - The dijkstra algorithm of the least of hops is used for path calculated in olsr . but the protocol only tries its best to transmit data , not considering the state of wireless link
它采用dijkstra算法計(jì)算跳數(shù)最短路徑,并盡力而為地傳送數(shù)據(jù)包,沒有考慮無(wú)線鏈路時(shí)延、帶寬等狀態(tài)和節(jié)點(diǎn)擁塞程度,這樣的路徑計(jì)算方式已經(jīng)不能滿足用戶對(duì)網(wǎng)絡(luò)提供服務(wù)質(zhì)量的要求。 - Choosing route for passengers is the key technology in the bus information system . there are many classic algorithms such as dijkstra algorithm and floyd algorithm to solve the problem . but they do n ' t fit for this problem
選擇路徑是公交信息系統(tǒng)中的關(guān)鍵技術(shù)，有很多經(jīng)典的算法解決最短路徑問題，如dijkstra算法和floyd算法，但大都不適合于公交查詢最短路徑。 - Base on exist hardware and network equipment the grid computing experimental environment is constituted in this paper . the parallel dijkstra algorithm to solve the short path problem is tested in the experimental environment
本文在介紹網(wǎng)格計(jì)算基本理論基礎(chǔ)上，在現(xiàn)有硬件環(huán)境下架構(gòu)了globus試驗(yàn)平臺(tái)，并在globus網(wǎng)格環(huán)境下測(cè)試了最短路徑問題的并行dijkstra算法。