Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，-Dijkstra' s algorithm is a typical shortest path algorithm used to calculate a node to all other nodes of the shortest path. Main features is the starting

Dijkstra Algoritm this is good program-Dijkstra Algoritm this is good program!!!

用堆优化的dijkstra,求一般图的最短路-Heap optimize dijkstra ' s seeking general diagram of the most short-circuit

应用Dijkstra算法对铁路网络两站点间最短径搜索，附有我国铁路网络数据。-Application of Dijkstra algorithm rail network between the two sites on the shortest route search, with China s railway network data.