数据结构 || 图中两点的最短路径(迪杰斯特拉算法)

从某个顶点出发到其他所有各点的最短路径迪杰斯特拉算法

数据结构采用有向图的邻接矩阵存储。

算法基本思想：

依路径长度递增的次序来求各个路径。

• 长度最短的路径一定是一条从源点直达的弧。
• 其他长度的路径求原点到其最短路径一定是以下两种情况之一：
  • 源点到此点一条直通弧。
  • 前面已经求得的最短路径中的其他顶点中到它的直通弧。

代码实现：

#include <iostream>
#include <limits.h>
#include <string>
#include <vector>
#include <iomanip>
using namespace std;
#define MAX_VERTEX_NUM 20
struct Graph {
	int arcs[MAX_VERTEX_NUM][MAX_VERTEX_NUM];
	string vexs[MAX_VERTEX_NUM];
	int vexnum, arcnum;
};

int LocateVex(Graph G, string v) {
	for (int i = 0; i < G.vexnum; i++) {
		if (G.vexs[i] == v) {
			return i;
		}
	}
	return -1;
}

void CreateGraph(Graph *G) {
	cout << "请输入顶点数和弧数: " << endl;
	cin >> G->vexnum >> G->arcnum;
	cout << "请输入顶点: " << endl;
	for (int i = 0; i < G->vexnum; i++) {
		cin >> G->vexs[i];
		G->arcs[i][i] = 0;
	}
	for (int i = 0; i < G->vexnum; i++) {
		for (int j = 0; j < G->vexnum; j++) {
			if (i != j) {
				G->arcs[i][j] = INT_MAX;
			}
		}
	}
	for (int i = 0; i < G->arcnum; i++) {
		cout << "请输入边的两个顶点, from v1 to v2: " << endl;
		string v1, v2;
		cin >> v1 >> v2;
		int i1 = LocateVex(*G, v1);
		int i2 = LocateVex(*G, v2);
		cout << "请输入弧的权值: " << endl;
		cin >> G->arcs[i1][i2];
	}
}

void Print(Graph G) {
	cout << "图的邻接矩阵是: " << endl;
	cout << "     ";
	for (int i = 0; i < G.vexnum; i++) {
		cout << setw(3) << G.vexs[i] << setw(3) << "|";
	}
	//cout << G.vexs[(G.vexnum - 1)];
	cout << endl;
	for (int i = 0; i < G.vexnum; i++) {
		cout << G.vexs[i] << "  ";
		for (int j = 0; j < G.vexnum; j++) {
			if (G.arcs[i][j] == INT_MAX) {
				cout << "|" << setw(5) << "∞";
			}
			else
				cout <<  "|" << setw(5) << G.arcs[i][j];
		}
		cout << "|" << endl;
	}
}

int ShortestPath_DIJ(Graph G) {
	cout << "请输入想查询到其他点最短距离的起点: " << endl;
	string s0;
	cin >> s0;
	int v0 = LocateVex(G, s0);
	if (v0 < 0) {
		cout << "wrong!" << endl;
		return -1;
	}
	const int num = G.vexnum;
	vector<int> path[num];
	int ShortPathTable[num];
	bool final[num];
	for (int i = 0; i < G.vexnum; i++) {
		final[i] = false;
		ShortPathTable[i] = G.arcs[v0][i];
		if (ShortPathTable[i] < INT_MAX) {
			path[i].push_back(v0);
			path[i].push_back(i);
		}
	}
	ShortPathTable[v0] = 0;
	final[v0] = true;
	for (int i = 1; i < G.vexnum; i++) {
		int min = INT_MAX;
		int v = 0;
		for (int w = 0; w < G.vexnum; w++) {
			if (!final[w]) {
				if (ShortPathTable[w] < min) {
					min = ShortPathTable[w];
					v = w;
				}	
			}
		}
		final[v] = true;
		for (int w = 0; w < G.vexnum; w++) {
			if (!final[w] && G.arcs[v][w] < INT_MAX && min + G.arcs[v][w] < ShortPathTable[w]) {
				ShortPathTable[w] = min + G.arcs[v][w];
				path[w].clear();
				path[w] = path[v];
				path[w].push_back(w);
			}
		}
	}
	for (int i = 0; i < num; i++) {
		if (i != v0) {
			if (ShortPathTable[i] == INT_MAX) {
				cout << "从源点" << G.vexs[v0] << "到终点" << G.vexs[i] << "不可达！" << endl;
			}
			else {
				cout << "从源点" << G.vexs[v0] << "到终点" << G.vexs[i] << "的最短路径: " << endl;
				cout << G.vexs[path[i][0]];
				for (int j = 1; j < path[i].size(); j++) {
					cout << "->" << G.vexs[path[i][j]];
				}
				cout << endl;
				cout << "其最短长度为: " << endl;
				cout << ShortPathTable[i] << endl; 
			}
			cout << "----------------------------------" << endl;
		}
	} 
	return 1;	 
}

int main () {
	Graph G;
	CreateGraph(&G);
	Print(G);
	ShortestPath_DIJ(G);
	return 0;
}

实现效果：