弗洛伊德算法（每一對頂點之間的最短路徑）

for( int i = 1 ;i <= vtxnum; ++i ) for( int j = 1; j <= vtxnum; ++j) { dist[i][j] = cost[i][j]; if( dist[i][j] < INFINITE) //i到j有邊 path[i,j] = [i]+[j]; } for( k = 1; k <= vtxnum; ++k) //中間點

>>阅读原文<<