数据结构中最短路径算法的实现  

Realization of the Shortest Path's Algorithm in Data Structure

作　　者：曹阳[1] 

机构地区：[1]陕西理工学院计算机系,陕西汉中723000

出　　处：《宜宾学院学报》2007年第6期82-84,共3页Journal of Yibin University

摘　　要：最短路径算法种类繁多,比较有名的算法包括:Dijkstra算法、Ford算法、Floyd算法、Moore算法、A*算法、K值算法,而即使同一种算法也有多种不同的实现方式。本文介绍了求最短路径的Dijkstra算法的设计思路及Visual C++语言编程实现。实验表明:该算法能高效地求出一个顶点到其它各顶点的所有最短路径。The shortest path＇ s algorithm is in a great variety of which the famous ones including Dijkstra Algorithm, Ford Algorithm, Floyd Algorithm, Moore Algorithm, A ＊ Algorithm and Value of K Algorithm. Even in the same algorithm, the realizing ways are different. This article introduces the design of the shortest path of Dijkstra and the realization of program- ming the language of Visual C ＋ ＋. All the shortest paths from one node to all other nodes can be derived quickly by using the algorithm.

关 键 词：最短路径 DIJKSTRA算法 VISUAL C++程序语言 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]