Dijkstra算法

Dijkstra算法

#include <iostream>
#include<cmath>
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define MAXSIZE 100
//定义无穷大
#define  MAXInt 32767
typedef int Status;
typedef char TElemType;
using namespace std;

//定义顶点数据类型
typedef char VerTexType;
//定义边的数据类型
typedef int ArcType;
//定义图的数据结构
typedef struct {
	//顶点表
	VerTexType vexs[MAXSIZE];
	//邻接矩阵
	ArcType arcs[MAXSIZE][MAXSIZE];
	//当前结点数和当期边数
	int vexnum, arcnum;
}AMGraph; //Adjacency(邻接) Matrix Graph
//函数输入一个顶点的值，返回该顶点在顶点表中的下标，不存在则返回-1
int LocateVex(VerTexType x, AMGraph& G) {
	for (int i = 0; i < G.vexnum; i++)
	{
		if (x == G.vexs[i])
		{
			return i;
		}
	}
	return -1;
}

void createUDN(AMGraph& G) {
	//先输入图的顶点数和边数
	cout << "请输入要创建的有向网的顶点数和边数：" << "\n";
	scanf_s("%d%d", &G.vexnum, &G.arcnum);
	//依次输入各个顶点的值
	cout << "依次输入各个顶点的值" << "\n";
	for (int i = 0; i < G.vexnum; i++) {
		cin >> G.vexs[i];
	}
	//对邻接矩阵进行初始化
	for (int i = 0; i < G.vexnum; i++) {

		for (int j = 0; j < G.vexnum; j++) {
			G.arcs[i][j] = MAXInt;
		}
	}
	cout << "请输入每条边的顶点和权值：输入方式：顶点1 顶点2 权值" << "\n";
	//输入依次输入每一条边的顶点和权值
	for (int i = 0; i < G.arcnum; i++)
	{
		VerTexType a, b;
		ArcType weight;
		cin >> a >> b >> weight;
		//找到输入的顶点a，b在顶点表中的下标
		int x = LocateVex(a, G);
		int y = LocateVex(b, G);
		if (x != -1 && y != -1) {
			G.arcs[x][y] = weight;
		}

	}


}
//输出顶点表以及邻接矩阵
void outPut(AMGraph G) {
	cout << "顶点表如下：" << "\n";
	for (int i = 0; i < G.vexnum; i++) {
		printf("%c ", G.vexs[i]);
	}
	printf("\n输出邻接矩阵如下\n");
	for (int i = 0; i < G.vexnum; i++)
	{
		for (int j = 0; j < G.vexnum; j++)
		{
			printf("%6d", G.arcs[i][j]);
		}
		printf("\n");
	}


}
//Dijkstra算法
//需要一个顶点集S
typedef struct {
	int vex[MAXSIZE];//存顶点的下标
	int length;
}SStruct;
//初始化UStruct
void InitS(SStruct& s) {
	s.length = 0;
}
//判断x下标是否在集合S中
bool IsInS(SStruct S, int x) {
	for (int i = 0; i < S.length; i++)
	{
		if (S.vex[i] == x)
		{
			return true;
		}
	}
	return false;
}
int D[MAXSIZE];


Status Dijkstra(AMGraph G, SStruct s) {
	while (s.length<G.vexnum)
	{
		int index = (s.length - 1);
		//上次加入的顶点s.vex[(s.length-1)]（下标）之后其他不在S集合中的顶点的路径长度的变化
		int preV = -1;
		preV=s.vex[index];
		for (int i = 0; i < G.vexnum; i++)
		{
			//即从preV顶点到i顶点的直达的边并且这个i顶点还未加入到S集合中
			if (G.arcs[preV][i]!=MAXInt && !IsInS(s, i))
			{
				//如果经过preV这个点可以使到达i顶点的距离变小则更新这个距离
				if (D[i]>(D[preV]+G.arcs[preV][i]))
				{
					D[i] = D[preV] + G.arcs[preV][i];
				}
			}
		}
		//在D[i]的未加入S集中的顶点找到一个最小的加入到S集合中
		int min = MAXInt;
		int minIndex = -1;
		for (int i = 0; i < G.vexnum; i++) {
			if (!IsInS(s,i)&&min>D[i])
			{
				min = D[i];
				minIndex = i;
			}
		}
		//加入S集合中
		s.vex[s.length++] = minIndex;

	}
	return OK;
}



int main() {
	AMGraph G;
	createUDN(G);
	outPut(G);
	cout << "请输入计算最短路径的源点：\n" << "";
	VerTexType x;
	SStruct s;
	InitS(s);
	//还需要一个数组存放每一次求出的从v0到各个终点的最短路径
	
	cin >> x;
	int i = LocateVex(x, G);
	//将源点的最短路径设置为0，并且将其加入已经求出最短路径的集合S中
	D[i] = 0;
	for (int  j = 0; j < G.vexnum; j++)
	{
		if (j!=i)
		{
			D[j] = MAXInt;//初始化全部的除了i顶点以外的顶点为不可达状态
		}
	}
	s.vex[s.length++] = i;
	Dijkstra(G, s);
	cout << x<<"顶点到各个顶点的最短路径长度为：" << "\n";
	for (int j = 0; j < G.vexnum; j++)
	{
		printf("%4c ", G.vexs[j]);
	}
	cout << "\n";
	for (int j = 0; j < G.vexnum; j++) {
		//cout << D[j] << " ";
		printf("%4d ", D[j]);
	}
	return 0;
}

测试：

测试量非常少！如果有bug可以底下留言~