///求单源最短路径#include #include #define maxint 1000int dist[maxint] ;int prev[maxint] ;int inta[maxint][maxint] ; //原始数据// prev[] 保存某个点的前驱点的下标// dist[] 保存源点到其余点的距离void Dijkstra(int n , int v , int s[][maxint] ){bool check[maxint] ;int i , j ;for( i = 1 ; i <= n ; i ++ ){ dist = s[v][i...
