Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。CSHARP实现算法

-Dijkstra algorithm is a typical shortest path algorithm, used to calculate the shortest path of a node to all other nodes. The main features are the starting point as the center outward expansion of the layers, until the extension to the end point so far. Dijkstra algorithm can come up with the most short-circuit path of the optimal solution, but because a lot of it traversing the computing node, so the efficiency is low. Dijkstra algorithm is a step-by-step search algorithm, to work to keep up to find the shortest path from m to n for each vertex n. CSHARP realization algorithm