摘要
提出了求一个顶点到另一个顶点的所有最短路径的一个算法,此算法中设计了一些独特的数据结构,在算法运行的整个过程中,求一个有效顶点(后面定义)到终点的所有最短路径的过程(入栈、出栈等操作)实际只进行一遍,用语言编制的相应程序验证了这个算法C的可靠性和实用性。
An algorithm for finding all the shortest paths from one node to another has been put forward. Some peculiar data structures are designed in this algorithm. The process for finding all the shortest paths from one effective node (defined below) to the extreme node is carried out only once in fact, so the efficiency of the algorithm is raised highly.In this article, some instances are provided to prove the algorithm reliable and useful.
出处
《计算机工程》
CAS
CSCD
北大核心
2002年第2期134-136,共3页
Computer Engineering
基金
华东师大中青年科研基金项目
