無向圖最短路徑dijkstra算法

#include <iostream> using namespace std; const int maxnum = 100; const int maxint = 999999; //Dijkstra(n, 1, dist, prev, c); void Dijkstra(int n, int v, int *dist, int *prev, int c[maxnum][maxnum

>>阅读原文<<