qq_43764457的博客

原创 校园导航系统

Dijkstra.h void Dijkstra(AdjMgraph G,int v0,int distance[],int path[]) { int n=G.Vertices.size; int *s = (int *)malloc(sizeof(int)*n); int minDis,i,j,u; for(i=0;i<n;i++) { distance[i] = G.edge[v0][...