📦 Dijkstra算法求最短路径(C#版) using System using System.Collections using System.Text namespace Greedy - 免费下载

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[] d) { this.row = n distance = new int[row * row] for (int i = 0 i < row * row i++) { this.distance[i] = d[i]

点击标签查看更多相关资源：