最短路徑問題

dijkstra算法代碼 #include "stdafx.h" #include<stdio.h> #include<stdlib.h> const int MAX=32767; const int N=6; int edge[N+1][N+1]= { {0,0,0,0,0,0,0}, {0,0,1,12,0,0,0}, {0,0,0,9,3,0,0}, {0,0,0,0,0,5,0}

>>阅读原文<<