Dijkstra算法求最短路径(C#版) using System using System.Collections using System.Text namespace Greedy { class Marx { private int[] distance private int row private ArrayList ways = new ArrayList() public Marx(int n,params int

这是一个C++编的Dijkstra算法，用于离散数学中求最短路径的问题。-This is a C++ compiled Dijkstra algorithm for shortest path problems in discrete mathematics.

大一时完成的求最短路径算法。利用C语言实现了经典的Dijkstra算法。转化矩阵图求取给定起点至其他结点的最短路径。 -Freshman completed the shortest path algorithm. Using C language to achieve a classic Dijkstra algorithm. Transformation matrix to strike the shortest path to a given starting point to oth