摘要
研究交通线路中的最短路径算法 ,应用图论中的广度优先搜索思想 ,给出优先队列的进出队方式 ,提供一种有效的最短路径的新算法 .该算法简洁、运算速度快、效果好 ,并在实际应用中取得了证明 .
A study is made on the algorithm of shortest path in traffic line. By applying the idea of scope first search in graph theory, the author gives the way of get in and out the queue in priority queue and offers an effective new algorithm of shortest path. This concise algorithm is confirmed by practical application to be fast in operation and good in effect.
出处
《华侨大学学报(自然科学版)》
CAS
2001年第2期139-142,共4页
Journal of Huaqiao University(Natural Science)