Dijkstra算法应用举例.docVIP

Dijkstra算法应用举例 20061002516 张昕 123062 16 某城市部分街道如下图所示 求到其他点的最短距离。 源程序如下 #include stdio.h #include stdlib.h #define TRUE 1 #define FALSE 0 #define MAXV 100 #define MAXDEGREE 50 #define MAXINT 100007 int parent[MAXV]; typedef struct { int v; int weight; } edge; typedef struct { edge edges[MAXV+1][MAXDEGREE]; int degree[MAXV+1]; int nvertices; int nedges; } graph; initialize_graph(graph* g) { int i; g - nvertices = 0; g - nedges = 0; for (i=1; i