• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2006, Vol. 28 ›› Issue (2): 83-85.

• 论文 • Previous Articles     Next Articles

  

  • Online:2006-02-01 Published:2010-05-20

Abstract:

A new algorithm for finding the shortest paths has been put forward in this paper. All the shortest paths from one node to all the other nodes can be derived quickly by using the algorithm. The algorithm is verified and implemented by a relevant C program.

Key words: shortest path, Diikstm algorithm, adjacent matrix