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

c#实现算法-Dijkstra algorithm is a typical example of the most short-circuit algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the date extended to the end. Dijkstra shortest path algorithm can arrive at the optimal solution, but because it traverse a lot of computing nodes, so inefficient. Dijkstra algorithm is a step by step search algorithm for each vertex n reservations so far found from the m to n shortest path to work. c# algorithm