P211 例9-4 以如图9-13所示的有向带权图为例设计测试上述Dijkstra函数的程序。

P211 例9-4 以如图9-13所示的有向带权图为例设计测试上述Dijkstra函数的程序。

头文件1：SeqList.h

#include<stdio.h>

#define MaxSize 100

typedef char DataType;

typedef struct
{
	DataType list[MaxSize];
	int size;
}SeqList;

void ListInitiate(SeqList *L)
{
	L->size=0;
}

int ListLength(SeqList L)
{
	return L.size;
}

int ListInsert(SeqList *L,int i, DataType x)
{
	int j;
	if(L->size>=MaxSize)
	{
		printf("数组已满无法插入!\n");
		return 0;
	}
	else if(i<0||i>L->size)
	{
		printf("参数i不合法！\n");
		return 0;
	}
	else
	{
		for(j=L->size;j>i;j--)
			L->list[j]=L->list[j-1];
		L->list[i]=x;
		L->size++;
		return 1;
	}
}

int ListDelete(SeqList *L,int i,DataType *x)
{
	int j;
	if(L->size<=0)
	{
		printf("顺序表已空无数据可删!\n");
		return 0;
	}
	else if(i<0||i>L->size-1)
	{
		printf("参数i不合法");
		return 0;
	}
	else
	{
		*x=L->list[i];
		for(j=i+1;j<=L->size-1;j++)
			L->list[j-1]=L->list[j];
		L->size--;
		return 1;
	}
}

int ListGet(SeqList L,int i,DataType *x)
{
	if(i<0||i>L.size-1)
	{
		printf("参数i不合法！\n");
		return 0;
	}
	else
	{
		*x=L.list[i];
		return 1;
	}
}

头文件2：AdjMGraph.h

#include"SeqList.h"

#define MaxVertices 10
#define MaxWeight 10000

typedef struct
{
	SeqList Vertices;
	int edge[MaxVertices][MaxVertices];
	int numOfEdges;
}AdjMGraph;

void Initiate(AdjMGraph *G,int n)
{
	int i,j;
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
			if(i==j)
				G->edge[i][j]=0;
			else
				G->edge[i][j]=MaxWeight;
		}
	}
		
	G->numOfEdges=0;
	ListInitiate(&G->Vertices);
}

void InsertVertex(AdjMGraph *G,DataType vertex)
{
	ListInsert(&G->Vertices,G->Vertices.size,vertex);
}

void InsertEdge(AdjMGraph *G,int v1,int v2,int weight)
{
	if(v1<0||v1>=G->Vertices.size||v2<0||v2>=G->Vertices.size)
	{
		printf("参数v1或v2越界出错!\n");
		return;
	}
	
	G->edge[v1][v2]=weight;
	G->numOfEdges++;
}

void DeleteEdge(AdjMGraph *G,int v1,int v2)
{
	if(v1<0||v1>=G->Vertices.size||v2<0||v2>=G->Vertices.size||v1==v2)
	{
		printf("参数v1或v2出错!\n");
		return;
	}
	
	if(G->edge[v1][v2]==MaxWeight||v1==v2)
	{
		printf("该边不存在!\n");
		return;
	}
	G->edge[v1][v2]=MaxWeight;
	G->numOfEdges--;
}

int GetFirstVex(AdjMGraph G,int v)
{
	int col;
	
	if(v<0||v>G.Vertices.size)
	{
		printf("参数v1越界出错!\n");
		return -1;
	}
	
	for(col=0;col<G.Vertices.size;col++)
	{
		if(G.edge[v][col]>0&&G.edge[v][col]<MaxWeight)
			return col;
	}
	return -1;
}

int GetNextVex(AdjMGraph G,int v1,int v2)
{
	int col;
	
	if(v1<0||v1>G.Vertices.size||v2<0||v2>G.Vertices.size)
	{
		printf("参数v1或v2越界出错!\n");
		return -1;
	}
	
	for(col=v2+1;col<G.Vertices.size;col++)
	{
		if(G.edge[v1][col]>0&&G.edge[v1][col]<MaxWeight)
			return col;
	}
	return -1;
}

头文件3：AdjMGraphCreate.h

#include"AdjMGraph.h"

typedef struct
{
	int row;
	int col;
	int weight;
}RowColWeight;

void CreatGraph(AdjMGraph *G,DataType V[],int n,RowColWeight E[],int e)
{
	int i,k;
	Initiate(G,n);
	for(i=0;i<n;i++)
		InsertVertex(G,V[i]);
		
	for(k=0;k<e;k++)
		InsertEdge(G,E[k].row,E[k].col,E[k].weight);
}

头文件4：Dijkstra.h

#include<stdlib.h>
#include"AdjMGraphCreate.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][i];
		s[i]=0;
		if(i!=v0&&distance[i]<MaxWeight)
			path[i]=v0;
		else
			path[i]=-1;
	}
	s[v0]=1;
	
	for(i=1;i<n;i++)
	{
		minDis=MaxWeight;
		for(j=0;j<n;j++)
		{
			if(s[j]==0&&distance[j]<minDis)
			{
				u=j;
				minDis=distance[j];
			}
		}
		if(minDis==MaxWeight)
			return;
		s[u]=1;
		for(j=0;j<n;j++)
		{
			if(s[j]==0&&G.edge[u][j]<MaxWeight&&distance[u]+G.edge[u][j]<distance[j])
			{
				distance[j]=distance[u]+G.edge[u][j];
				path[j]=u;
			}
		}
	}
}

源文件：例9-4.c

#include<stdio.h>

#include"Dijkstra.h"

int main()
{ 
	AdjMGraph g;
	char a[]={'A','B','C','D','E','F'};
	RowColWeight rcw[]={{0,2,5},{0,3,30},{1,0,2},{1,4,8},{2,1,15},{2,5,7},{4,3,4},{5,3,10},{5,4,18}};
	int i,n=6,e=9;
	int distance[6],path[6];
	
	CreatGraph(&g,a,n,rcw,e);
	
	Dijkstra(g,0,distance,path);
	
	printf("从结点%c到其他各节点的最短距离为:\n",g.Vertices.list[0]);
	for(i=0;i<n;i++)
		printf("到结点%c的最短距离为:%d\n",g.Vertices.list[i],distance[i]);
	printf("从结点%c到其他各节点最短路径的前一结点为:\n",g.Vertices.list[0]);
	for(i=0;i<n;i++)
	{
		if(path[i]!=-1)
			printf("到结点%c的前一结点为:%c\n",g.Vertices.list[i],g.Vertices.list[path[i]]);
	}
	return 0;
}