// ConsoleApplication16.cpp: 定义控制台应用程序的入口点。
//迪杰斯特拉算法
#include "stdafx.h"
#include<iostream>
using namespace std;
#define OK 1
#define ERROR -1
#define MAXINT 32767
#define MAXNUM 100
typedef char VerTexType;
typedef int ArcType;
typedef int Status;
typedef struct {
VerTexType vexs[MAXNUM];
ArcType arcs[MAXNUM][MAXNUM];
int vexnum, arcnum;
}AMGraph;
int * D = new int[MAXNUM];
bool *S = new bool[MAXNUM];
int *Path = new int[MAXNUM];
Status LocateVex(AMGraph G, VerTexType e) {
for (int i = 0; i < G.vexnum; i++) {
if (G.vexs[i] == e) {
return i;
}
}
return ERROR;
}
void Create_AMGraph(AMGraph &G) {
cout << "输入要创建无向图的顶点数和边数";
cin >> G.vexnum >> G.arcnum;
for (int i = 0; i < G.vexnum; i++) {
cout << "输入第" << i + 1 << "个顶点的值";
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; //权值初始化为MAXINT
}
}
// 由确定的边确定边的信息
for (int i = 0; i < G.arcnum; i++) {
char s1, s2;
int weight, dir1, dir2;
cout << "输入第" << i + 1 << "条边对应的两个顶点及权值大小";
cin >> s1 >> s2 >> weight;
dir1 = LocateVex(G, s1);
dir2 = LocateVex(G, s2);
G.arcs[dir1][dir2] = weight;
}
}
void ShortestPath_DIJ(AMGraph G, int v0) {
// 求从第v0个顶点到其余各顶点的最短路径
int n = G.vexnum;
int v;
for (int i = 0; i < n; i++) {
S[i] = false;
// 初始化v0到其余各顶点的距离
D[i] = G.arcs[v0][i];
// 是否存在弧
if (D[i] < MAXINT)Path[i] = v0;
else Path[i] = -1; // 不存在则置前驱为-1
}
S[v0] = true;// 将v0加入到S中
D[v0] = 0;
/******************初始化结束,利用循环求从v0到其余各个顶点的最短距离*********/
for (int i = 1; i < G.vexnum; i++) {
int MIN = MAXINT;
for (int w = 0; w < G.vexnum; w++) {
if (!S[w] && D[w] < MIN) {
// 更新最小值的信息
// 终点信息暂存于v中
v = w; MIN = D[w];
}
}
S[v] = true;
for (int w = 0; w < G.vexnum; w++) {
//更新从v0到其余各个顶点的长度
if (!S[w] && (D[v] + G.arcs[v][w] < D[w])) {
D[w] = D[v] + G.arcs[v][w];
Path[w] = v;
}//if
}//for
}//for
}
void Display_DIJ(AMGraph G,int begin,int temp) {
if (Path[temp] != -1) {
Display_DIJ(G, begin, Path[temp]);
cout << G.vexs[Path[temp]] << "-->";
}
}
void Print_AMGraph(AMGraph G) {
for (int i = 0; i < G.vexnum; i++) {
for (int j = 0; j < G.vexnum; j++) {
if (G.arcs[i][j] == MAXINT) {
cout << " " << "∞";
}
else {
cout << " " << G.arcs[i][j];
}
}//for
cout << endl;
}
}
int main()
{
AMGraph G;
Create_AMGraph(G);
Print_AMGraph(G);
int dir1, dir2;
cout << "输入起点与终点的顶点";
char s1, s2;
cin >> s1 >> s2;
dir1 = LocateVex(G, s1); dir2 = LocateVex(G, s2);
ShortestPath_DIJ(G, dir1);
Display_DIJ(G, dir1, dir2);
char c;
cin >> c;
return 0;
}
//迪杰斯特拉算法
#include "stdafx.h"
#include<iostream>
using namespace std;
#define OK 1
#define ERROR -1
#define MAXINT 32767
#define MAXNUM 100
typedef char VerTexType;
typedef int ArcType;
typedef int Status;
typedef struct {
VerTexType vexs[MAXNUM];
ArcType arcs[MAXNUM][MAXNUM];
int vexnum, arcnum;
}AMGraph;
int * D = new int[MAXNUM];
bool *S = new bool[MAXNUM];
int *Path = new int[MAXNUM];
Status LocateVex(AMGraph G, VerTexType e) {
for (int i = 0; i < G.vexnum; i++) {
if (G.vexs[i] == e) {
return i;
}
}
return ERROR;
}
void Create_AMGraph(AMGraph &G) {
cout << "输入要创建无向图的顶点数和边数";
cin >> G.vexnum >> G.arcnum;
for (int i = 0; i < G.vexnum; i++) {
cout << "输入第" << i + 1 << "个顶点的值";
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; //权值初始化为MAXINT
}
}
// 由确定的边确定边的信息
for (int i = 0; i < G.arcnum; i++) {
char s1, s2;
int weight, dir1, dir2;
cout << "输入第" << i + 1 << "条边对应的两个顶点及权值大小";
cin >> s1 >> s2 >> weight;
dir1 = LocateVex(G, s1);
dir2 = LocateVex(G, s2);
G.arcs[dir1][dir2] = weight;
}
}
void ShortestPath_DIJ(AMGraph G, int v0) {
// 求从第v0个顶点到其余各顶点的最短路径
int n = G.vexnum;
int v;
for (int i = 0; i < n; i++) {
S[i] = false;
// 初始化v0到其余各顶点的距离
D[i] = G.arcs[v0][i];
// 是否存在弧
if (D[i] < MAXINT)Path[i] = v0;
else Path[i] = -1; // 不存在则置前驱为-1
}
S[v0] = true;// 将v0加入到S中
D[v0] = 0;
/******************初始化结束,利用循环求从v0到其余各个顶点的最短距离*********/
for (int i = 1; i < G.vexnum; i++) {
int MIN = MAXINT;
for (int w = 0; w < G.vexnum; w++) {
if (!S[w] && D[w] < MIN) {
// 更新最小值的信息
// 终点信息暂存于v中
v = w; MIN = D[w];
}
}
S[v] = true;
for (int w = 0; w < G.vexnum; w++) {
//更新从v0到其余各个顶点的长度
if (!S[w] && (D[v] + G.arcs[v][w] < D[w])) {
D[w] = D[v] + G.arcs[v][w];
Path[w] = v;
}//if
}//for
}//for
}
void Display_DIJ(AMGraph G,int begin,int temp) {
if (Path[temp] != -1) {
Display_DIJ(G, begin, Path[temp]);
cout << G.vexs[Path[temp]] << "-->";
}
}
void Print_AMGraph(AMGraph G) {
for (int i = 0; i < G.vexnum; i++) {
for (int j = 0; j < G.vexnum; j++) {
if (G.arcs[i][j] == MAXINT) {
cout << " " << "∞";
}
else {
cout << " " << G.arcs[i][j];
}
}//for
cout << endl;
}
}
int main()
{
AMGraph G;
Create_AMGraph(G);
Print_AMGraph(G);
int dir1, dir2;
cout << "输入起点与终点的顶点";
char s1, s2;
cin >> s1 >> s2;
dir1 = LocateVex(G, s1); dir2 = LocateVex(G, s2);
ShortestPath_DIJ(G, dir1);
Display_DIJ(G, dir1, dir2);
char c;
cin >> c;
return 0;
}