《最短路径迪杰斯特拉算法》由会员分享，可在线阅读，更多相关《最短路径迪杰斯特拉算法（8页珍藏版）》请在装配图网上搜索。
1、#include#include#define MAX_VERTEX_NUM 50#define FALSE 0#define TRUE 1#define INFINITY 100000typedef structchar vexsMAX_VERTEX_NUM100;int arcsMAX_VERTEX_NUMMAX_VERTEX_NUM;int vexnum, arcnum;MGraph;int Location(MGraph G, char);int Create(MGraph &G)int i, j, k;int w;char v1100, v2100;printf(请分别输入顶点和途径
2、旳旳个数：n);scanf(%d%d, &G.vexnum, &G.arcnum);for(i=0; i for(j=0; j G.arcsij = INFINITY; printf(请输入%d个顶点:n,G.vexnum);for(k=0; k scanf(%s, G.vexsk);for(k=0; k printf(请输入第%d条弧上旳两个顶点以及弧旳权值:n,k+1); scanf(%s%s%d, v1, v2, &w); i = Location(G,v1); j = Location(G,v2); G.arcsij = w;return 0;int Location(MGraph G
3、, char ch)int i;for(i=0; i if( !strcmp(G.vexsi, ch) break; return i;void ShortestPath(MGraph G, int v0, int PMAX_VERTEX_NUMMAX_VERTEX_NUM, int D)int v, w;int i, k;int min;int finalMAX_VERTEX_NUM;for(v=0; v finalv = FALSE; Dv = G.arcsv0v; for(w=0; w Pvw = FALSE; if( Dv INFINITY) Pvv0 = TRUE; Pvv = TR
4、UE; Dv0 = 0; finalv0 = TRUE; Pv0v0 = TRUE; for(i=1; i min = INFINITY; for(w=0; w if(!finalw) if(Dw min) v = w; min = Dw; finalv = TRUE; for(w=0; w if( !finalw & (min + G.arcsvw %s,G.vexsk, G.vexsi); if( Di = INFINITY) printf(无途径n); else printf(途径为:); printf(, G.vexsj); printf(bb); printf(); printf(途径长度为%d,Di); printf(n); return 0;
最短路径迪杰斯特拉算法
