最短路径生成算法

最短路径生成算法

1、Floyd最短路径生成算法

#include "stdio.h"
#include "stdlib.h"

#include "math.h"
#include "time.h"

#define MAXVEX 9
#define MAXEDGE 15
#define INFINITY  65535 /*无穷大*/
typedef char VexType; /*顶点数据类型*/
typedef int ShortWeightArc[MAXVEX][MAXVEX];/*最短路径权值矩阵*/
typedef int PathArc[MAXVEX][MAXVEX];/*最短路径前驱矩阵*/

typedef struct MGraph
{
	int vexNum;
	int edgeNum;
	VexType vexList[MAXVEX];
	int arc[MAXVEX][MAXVEX];
}MGraph;

/*构造网图*/
void CreateGraph(MGraph* G)
{
	int i, j;
	G->vexNum = 9;
	G->edgeNum = 15;

	VexType ch = 'A';

	/*初始化邻接矩阵同时给顶点赋值*/
	for (i = 0; i < G->vexNum; i++)
	{
		for (j = 0; j < G->vexNum; j++)
		{
			G->arc[i][j] = INFINITY;
		}
		G->arc[i][i] = 0;
		G->vexList[i] = ch++;
	}

	G->arc[0][1] = 1;
	G->arc[0][2] = 5;
	G->arc[1][2] = 3;
	G->arc[1][3] = 7;
	G->arc[1][4] = 5;

	G->arc[2][4] = 1;
	G->arc[2][5] = 7;
	G->arc[3][4] = 2;
	G->arc[3][6] = 3;
	G->arc[4][5] = 3;

	G->arc[4][6] = 6;
	G->arc[4][7] = 9;
	G->arc[5][7] = 5;
	G->arc[6][7] = 2;
	G->arc[6][8] = 7;

	G->arc[7][8] = 4;

	for (i = 0; i < G->vexNum; i++)
	{
		for (j = 0; j < G->vexNum; j++)
		{
			G->arc[j][i] = G->arc[i][j];
		}
	}
}

void ShortestPath_Floyd(MGraph G,ShortWeightArc *D,PathArc* P)
{
	int i, j,k;
	/*初始化最短路径权值矩阵和最短路径后继矩阵*/
	for (i = 0; i < G.vexNum; i++)
	{
		for (j = 0; j < G.vexNum; j++)
		{
			(*D)[i][j] = G.arc[i][j];
			(*P)[i][j] = j;
		}
	}

	for (k = 0; k < G.vexNum; k++)/*Vk为中间节点*/
	{
		for (i = 0; i < G.vexNum; i++)/*Vi为初始节点*/
		{
			for (j = 0; j < G.vexNum; j++)/*Vj为终结点*/
			{
				if ((*D)[i][j] > (*D)[i][k] + (*D)[k][j])
				{/*若经过下标为k的节点的路径比两点间直接路径要短*/
					(*D)[i][j] = (*D)[i][k] + (*D)[k][j];/*将两点间的权值设为较小的一个*/
					(*P)[i][j] = (*P)[i][k];/*并将该路径的后继节点设为经过下标为k的路径的后继节点*/
				}
			}
		}
	}

	
}

void main()
{
	int i, j, k;
	MGraph M;
	CreateGraph(&M);

	printf("矩阵M.arc:\n");
	for (i = 0; i < M.vexNum; i++)
	{
		for (j = 0; j < M.vexNum; j++)
		{
			printf("%d\t",M.arc[i][j]);
		}
		printf("\n");

	}
	printf(" \n");

	ShortWeightArc D;
	PathArc P;
	ShortestPath_Floyd(M, &D, &P);

	

	printf("矩阵D:\n");
	for (i = 0; i < M.vexNum; i++)
	{
		for (j = 0; j < M.vexNum; j++)
		{
			printf("%d\t", D[i][j]);
		}
		printf("\n");
		
	}
	printf(" \n");

	printf("矩阵P:\n");
	for (i = 0; i < M.vexNum; i++)
	{
		for (j = 0; j < M.vexNum; j++)
		{
			printf("%d\t", P[i][j]);
		}
		printf("\n");

	}
	printf(" \n");
	for (i = 0; i < M.vexNum; i++)
	{
		for (j = i + 1; j < M.vexNum; j++)
		{
			k = i;
			printf("路径%d-->%d的权值：%d,以及所经过的路径：", i, j, D[i][j]);
			while (k!=j)
			{
				printf("%d-->", k);
				k = P[k][j];
			}
			printf("%d\n", j);
		}
	}
}

2、Dijkstra最短路径生成算法

#include "stdio.h"
#include "stdlib.h"

#include "math.h"
#include "time.h"

/*Dijkstra算法，是求V0顶点到其余顶点的最短路径P[v]以及带权长度D[v]*/
#define INFINITY 65535
#define MAXVEX 9
typedef char VexType;
int final[MAXVEX];/*V0到Vi是否找到最短路径标志*/
typedef struct MGraph
{
	VexType vexList[MAXVEX];
	int vexNum;
	int edgeNum;
	int arc[MAXVEX][MAXVEX];
}MGraph;

typedef int ShortestWeightArc[MAXVEX];/*最短路径权值*/
typedef int PathArc[MAXVEX];/*最短路径前驱节点*/

/*构造网图*/
void CreateGraph(MGraph* G)
{
	int i, j;
	G->vexNum = 9;
	G->edgeNum = 15;

	VexType ch = 'A';

	/*初始化邻接矩阵同时给顶点赋值*/
	for (i = 0; i < G->vexNum; i++)
	{
		for (j = 0; j < G->vexNum; j++)
		{
			G->arc[i][j] = INFINITY;
		}
		G->arc[i][i] = 0;
		G->vexList[i] = ch++;
	}

	G->arc[0][1] = 1;
	G->arc[0][2] = 5;
	G->arc[1][2] = 3;
	G->arc[1][3] = 7;
	G->arc[1][4] = 5;

	G->arc[2][4] = 1;
	G->arc[2][5] = 7;
	G->arc[3][4] = 2;
	G->arc[3][6] = 3;
	G->arc[4][5] = 3;

	G->arc[4][6] = 6;
	G->arc[4][7] = 9;
	G->arc[5][7] = 5;
	G->arc[6][7] = 2;
	G->arc[6][8] = 7;

	G->arc[7][8] = 4;

	for (i = 0; i < G->vexNum; i++)
	{
		for (j = 0; j < G->vexNum; j++)
		{
			G->arc[j][i] = G->arc[i][j];
		}
	}
}

/*Dijkstra最短路径寻找*/
void ShortestPathz_Dijkstra(MGraph G,int v0, ShortestWeightArc* D, PathArc* P)
{
	int i, j, k,min;/*k表示已生成路径的最后一个节点(即待生成路径的前驱节点)*/
	/*初始化矩阵D、P*/
	for (i = 0; i < G.vexNum; i++)
	{
		(*D)[i] = G.arc[v0][i];
		(*P)[i] = -1;
		final[i] = 0;
	}
	final[v0] = 1;/*由于V0点为初始点，故V0到V0不需要路径*/

	for (i = 1; i < G.vexNum; i++)
	{
		min = INFINITY;

		/*寻找当前生成路径的终结点的下一个节点，即距离终结点最近的节点*/
		for (j = 0; j < G.vexNum; j++)
		{
			if (!final[j] && (*D)[j] < min)
			{
				k = j;
				min = (*D)[j];/*找到当前已生成路径的最短路径长度*/
			}
		}

		final[k] = 1;

		/*修正当前最短路径及距离*/
		for (j = 0; j < G.vexNum; j++)
		{
			/*若经过Vk的路径比当前路径短的话*/
			if (!final[j] && (min + G.arc[k][j] < (*D)[j]))
			{
				(*D)[j] = min + G.arc[k][j];/*将经过Vk的这条路径长度作为V0到Vj的新路径长度*/
				(*P)[j] = k;/*记录该路径前驱节点Vk*/
			}
		}
	}
	
}

void main()
{
	MGraph G;
	CreateGraph(&G);
	ShortestWeightArc D;
	PathArc P;
	ShortestPathz_Dijkstra(G, 0, &D, &P);

	for (int i = 1; i < G.vexNum; i++)
	{
		int k=i;
		printf("V0到V%d的最短路径长度为：%d,路径为：V0", i, D[i]);
		while (k!=-1)
		{
			printf("-->%d", k);
			k = P[k];
		}
		printf("\n");

	}
}