#define MAXVERTEX 6
  bool final[MAXVERTEX];
  int dist[MAXVERTEX];
  int path[MAXVERTEX];

#include<iostream>
using namespace std;
// 模擬實(shí)現(xiàn)Dijkstra算法，不適用于存在負(fù)值的帶權(quán)圖
#define MAXVERTEX 6
typedef struct {
	char Vertex[MAXVERTEX]; //頂點(diǎn)集
	int Edge[MAXVERTEX][MAXVERTEX]; // 存放權(quán)值
	int vernum, arcnum; // 頂點(diǎn)數(shù)和邊數(shù)
}MGraph;

// 初始化圖
void InitGraph(MGraph& G) {
	G.Vertex[0] = 'A';
	G.Vertex[1] = 'B';
	G.Vertex[2] = 'C';
	G.Vertex[3] = 'D';
	G.Vertex[4] = 'E';
	G.vernum = 5;
	G.arcnum = 10;

	// 圖中邊權(quán)值均設(shè)為無窮大
	for (int i = 0; i < G.vernum; i++) {
		for (int j = 0; j < G.vernum; j++) {
			G.Edge[i][j] = INT_MAX;
		}
	}
	// 根據(jù)具體圖形設(shè)置具體權(quán)值
	G.Edge[0][1] = 10; // 諸如此類
	G.Edge[0][4] = 5;
	G.Edge[1][2] = 1;
	G.Edge[1][4] = 2;
	G.Edge[4][1] = 3;
	G.Edge[2][3] = 4;
	G.Edge[3][2] = 6;
	G.Edge[4][3] = 2;
	G.Edge[3][0] = 7;
	G.Edge[4][2] = 9;
}
bool final[MAXVERTEX];
int dist[MAXVERTEX];
int path[MAXVERTEX];

void Dijkstra(MGraph G,int v) {
	for (int i = 0; i < G.vernum; i++) {
		final[i] = false;
		dist[i] = G.Edge[v][i];
		path[i] = (G.Edge[v][i] == INT_MAX ? -1 : v);
	}
	final[v] = true;
	dist[v] = 0;
	// 第一輪
	int index =v; // 權(quán)值最小的邊頂點(diǎn)下標(biāo)
	int para = INT_MAX;
	for (int j = 0; j < G.vernum; j++) {
		if (final[j] == false && G.Edge[v][j] < para) {
			para = G.Edge[v][j];
			index = j;
		}
	}
	// 第二輪及以后
	for (int i = 0; i < G.vernum; i++) {
		for (int c = 0; c < G.vernum; c++) {
			if (final[c] ==false && G.Edge[index][c] < INT_MAX) {
				if (G.Edge[index][c] + dist[index] < dist[c]) {
					dist[c] = G.Edge[index][c] + dist[index];
					path[c] = index;
				}
			}
		}
		// 找到final 為false的頂點(diǎn)中權(quán)值最小的頂點(diǎn)下標(biāo)
		int temp = INT_MAX;
		int in = v;
		for (int i = 0; i < G.vernum; i++) {
			if (final[i] == false && dist[i] < temp) {
				temp = dist[i];
				in = i;
			}
		}
		index = in; // 更新下標(biāo)
		final[index] = true;
	}
}

void print_path(MGraph G ,int v) {
	cout << "對(duì)應(yīng)的最短路徑為：";
	cout << G.Vertex[v] << "->";
	for (int i = 0; i < G.vernum; i++) {
		if (path[v] != 1) {
			cout << G.Vertex[path[v]] << "->";
			v = path[v];
		}
	}
	cout << G.Vertex[1] << endl;
}

int main() {
	MGraph G;
	InitGraph(G);
	Dijkstra(G, 1);
	cout << "頂點(diǎn)B到頂點(diǎn)D的最小花費(fèi)為："<< dist[3] << endl;
	print_path(G, 3);
}

Dijkstra(G,0);
// dist[2];
cout<<"頂點(diǎn)A到頂點(diǎn)C的最短路徑為"<<dist[2]<<endl;
void print_path(MGraph G ,int v) {
	cout << "對(duì)應(yīng)的最短路徑為：";
	cout << G.Vertex[v] << "->";
	for (int i = 0; i < G.vernum; i++) {
		if (path[v] != 0) {
			cout << G.Vertex[path[v]] << "->";
			v = path[v];
		}
	}
	cout << G.Vertex[0] << endl;
}