#include<stdio.h>
#include<stdlib.h>
#include<stdbool.h>
#define VexType char
#define EdgeType int
#define MaxVexNum 100//顶点数目的最大值
typedef struct{
VexType Vex[MaxVexNum];//顶点
EdgeType Edge[MaxVexNum][MaxVexNum];//边的权
int vexnum,arcnum;//顶点数、边数
}Graph;
void InitGraph(Graph &G){
G.vexnum = G.arcnum = 0;
}
void InsertVex(Graph &G,VexType v){
G.Vex[G.vexnum++] = v;
}
int LocateVex(Graph &G,VexType v){
for(int i=0;i<=G.vexnum;i++){
if(v == G.Vex[i]) return i;
}
return -1;
}
void InsertEdge(Graph &G,VexType v1,VexType v2,EdgeType e){
int v1num = LocateVex(G,v1);
int v2num = LocateVex(G,v2);
G.Edge[v1num][v2num] = e;
G.arcnum ++;
}
void ShowGraph(Graph &G){
printf(" ");
for(int i=0;i<=G.vexnum;i++){
printf("%c\t",G.Vex[i]);
}
printf("\n");
for(int i=0;i<G.vexnum;i++){
printf("%c ",G.Vex[i]);
for(int j=0;j<G.vexnum;j++){
printf("%d\t",G.Edge[i][j]);
}
printf("\n");
}
printf("\n");
}
void ShortPathDij(Graph &G,VexType v){
int dist[MaxVexNum] = {-1};//最短路径长度数组
int path[MaxVexNum] = {-1};//最短路径前驱点数组
int min = 1;
bool s[MaxVexNum] = {false};//false为没被访问过的,true为已经访问过的
int vnum = LocateVex(G,v);
//初始化
for(int i=0;i<G.vexnum;i++){
if(G.Edge[vnum][i] == 0) dist[i] = -1;//如果两点间没有edge,dist置成-1
else dist[i] = G.Edge[vnum][i];//初始化dist
if(dist[i]>0) path[i] = vnum;
else path[i] = -1;//初始化path
}
dist[vnum] = 0;//起始点的dist置为0
s[vnum] = true;//起始点已经被访问,置成true
int cnt =1;//计数器
while(cnt < G.vexnum){
min =1;
for(int i=1;i<G.vexnum;i++){
if(!s[i]){
if(dist[i]<dist[min] && dist[i]>0){
min = i;
}
}
}
s[min] = true;
for(int i=0;i<G.vexnum;i++){
if(!s[i] && G.Edge[min][i]>0){//edge存在
if(dist[i]>(dist[min]+G.Edge[min][i]) || dist[i] == -1){//dist==-1代表min结点和i结点间没有edge
dist[i] = dist[min] + G.Edge[min][i];
path[i] = min;
}
}
}
cnt ++;
}
printf(" ");//输出
for(int i=0;i<G.vexnum;i++){printf("%c\t",G.Vex[i]);}printf("\n");
printf("dist ");
for(int i=0;i<G.vexnum;i++){printf("%d\t",dist[i]);}printf("\n");
printf("path ");
for(int i=0;i<G.vexnum;i++){printf("%d\t",path[i]);}printf("\n");printf("\n");
}
int main(){
Graph G;
InitGraph(G);
InsertVex(G,'A');
InsertVex(G,'B');
InsertVex(G,'C');
InsertVex(G,'D');
InsertVex(G,'E');
InsertEdge(G,'A','B',10);
InsertEdge(G,'A','E',5);
InsertEdge(G,'B','C',1);
InsertEdge(G,'B','E',2);
InsertEdge(G,'C','D',4);
InsertEdge(G,'D','A',7);
InsertEdge(G,'D','C',6);
InsertEdge(G,'E','B',3);
InsertEdge(G,'E','D',2);
InsertEdge(G,'E','C',9);
ShowGraph(G);
ShortPathDij(G,'A');
return 0;
}
输出结果如下:
本代码使用以下图例进行测试: