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

Dijkstra算法通过邻接表实现最短路径，-Dijkstra algorithm to achieve the shortest path adjacency list,

基于dijkstra算法实现求节点到其他节点的最短路径-Dijkstra algorithm based on the node to other nodes seeking the shortest path

最短路径问题,迪杰斯特拉算法,图像,读取数据,linux-The shortest path problem, Dijkstra algorithm

实现单元最短路径（贪心算法）的程序设计 ，算法分析与设计-Unit shortest path (greedy algorithm) program design, algorithm analysis and design