#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<set>
#include<list>
#include<queue>
#include<vector>
#include<map>
#include<iterator>
#include<algorithm>
#include<iostream>
#define MaxVerNum 100 //顶点最大数目值
#define VexType char //顶点数据类型
#define EdgeType int //边数据类型,无向图时邻接矩阵对称,有权值时表示权值,没有时1连0不连
#define INF 0x3f3f3f3f//作为最大值
using namespace std;
const int MAXV = 110;
const int MAXE = 10010;
//边集定义部分
struct edge
{
int u, v; //边的两个端点编号
int cost; //边权
}E[MAXE]; //最多有MAXE条边
bool cmp(edge a, edge b)
{
return a.cost < b.cost;
}
//并查集部分
int father[MAXV]; //并查集数组
int findFather(int x) //并查集查询函数
{
int a = x;
while (x != father[x])
{
x = father[x];
}
//路径压缩
while (a != father[a])
{
int z = a;
a = father[a];
father[z] = x;
}
return x;
}
//图的数据结构
typedef struct Graph
{
VexType Vex[MaxVerNum];//顶点表
EdgeType Edge[MaxVerNum][MaxVerNum];//边表
int vexnum, arcnum;//顶点数、边数
}Graph;
//迪杰斯特拉算法全局变量
bool S[MaxVerNum]; //顶点集
int D[MaxVerNum]; //到各个顶点的最短路径
int Pr[MaxVerNum]; //记录前驱
//Prim算法所用数据结构
typedef struct closedge
{
int adjvex; //最小边在集合U(最小边在当前子树顶点集合中的那个顶点的下标)
int lowcost; //最小边上的权值
};
//Kruskal算法所用的数据结构
//*********************************************基本操作函数*****************************************//
//初始化函数 参数:图G 作用:初始化图的顶点表,邻接矩阵等
void InitGraph(Graph& G)
{
memset(G.Vex, '#', sizeof(G.Vex));//初始化顶点表
//初始化边表
for (int i = 0; i < MaxVerNum; i++)
for (int j = 0; j < MaxVerNum; j++)
{
G.Edge[i][j] = INF;
if (i == j)G.Edge[i][j] = 0;//在最小生成树时,考虑无环简单图,故自己到自己设置为0
}
G.arcnum = G.vexnum = 0; //初始化顶点数、边数
}
//插入点函数 参数:图G,顶点v 作用:在图G中插入顶点v,即改变顶点表
bool InsertNode(Graph& G, VexType v)
{
if (G.vexnum < MaxVerNum)
{
G.Vex[G.vexnum++] = v;
return true;
}
return false;
}
//插入边函数 参数:图G,某边两端点v和w 作用:在图G两点v,w之间加入边,即改变邻接矩阵
bool InsertEdge(Graph& G, VexType v, VexType w, int weight)
{
int p1, p2;//v,w两点下标
p1 = p2 = -1;//初始化
for (int i = 0; i < G.vexnum; i++)//寻找顶点下标
{
if (G.Vex[i] == v)p1 = i;
if (G.Vex[i] == w)p2 = i;
}
if (-1 != p1 && -1 != p2)//两点均可在图中找到
{
G.Edge[p1][p2] = G.Edge[p2][p1] = weight;//无向图邻接矩阵对称
G.arcnum++;
return true;
}
return false;
}
//判断是否存在边(v,w)函数 参数:图G,某边两端点v和w 作用:判断是否存在边(v,w)
bool Adjancent(Graph G, VexType v, VexType w)
{
int p1, p2;//v,w两点下标
p1 = p2 = -1;//初始化
for (int i = 0; i < G.vexnum; i++)//寻找顶点下标
{
if (G.Vex[i] == v)p1 = i;
if (G.Vex[i] == w)p2 = i;
}
if (-1 != p1 && -1 != p2)//两点均可在图中找到
{
if (G.Edge[p1][p2] == 1)//存在边
{
return true;
}
return false;
}
return false;
}
bool visited[MaxVerNum];//访问标记数组,用于遍历时的标记
//广度遍历函数 参数:图G,开始结点下标start 作用:宽度遍历
void BFS(Graph G, int start)
{
queue<int> Q;//辅助队列
cout << G.Vex[start];//访问结点
visited[start] = true;
Q.push(start);//入队
while (!Q.empty())//队列非空
{
int v = Q.front();//得到队头元素
Q.pop();//出队
for (int j = 0; j < G.vexnum; j++)//邻接点
{
if (G.Edge[v][j] < INF && !visited[j])//是邻接点且未访问
{
cout << "->";
cout << G.Vex[j];//访问结点
visited[j] = true;
Q.push(j);//入队
}
}
}//while
cout << endl;
}
//深度遍历函数(递归形式)参数:图G,开始结点下标start 作用:深度遍历
void DFS(Graph G, int start)
{
cout << G.Vex[start];//访问
visited[start] = true;
for (int j = 0; j < G.vexnum; j++)
{
if (G.Edge[start][j] < INF && !visited[j])//是邻接点且未访问
{
cout << "->";
DFS(G, j);//递归深度遍历
}
}
}
//最短路径 - Dijkstra算法 参数:图G、源点v
void Dijkstra(Graph G, int v)
{
//初始化
int n = G.vexnum;//n为图的顶点个数
for (int i = 0; i < n; i++)
{
S[i] = false;
D[i] = G.Edge[v][i];
if (D[i] < INF)Pr[i] = v; //v与i连接,v为前驱
else Pr[i] = -1;
}
S[v] = true;
D[v] = 0;
//初始化结束,求最短路径,并加入S集
for (int i = 1; i < n; i++)
{
int min = INF;
int temp;
for (int w = 0; w < n; w++)
if (!S[w] && D[w] < min) //某点temp未加入s集,且为当前最短路径
{
temp = w;
min = D[w];
}
S[temp] = true;
//更新从源点出发至其余点的最短路径 通过temp
for (int w = 0; w < n; w++)
if (!S[w] && D[temp] + G.Edge[temp][w] < D[w])
{
D[w] = D[temp] + G.Edge[temp][w];
Pr[w] = temp;
}
}
}
//输出最短路径
void Path(Graph G, int v)
{
if (Pr[v] == -1)
return;
Path(G, Pr[v]);
cout << G.Vex[Pr[v]] << "->";
}
//**********************************************功能实现函数*****************************************//
//打印图的顶点表
void PrintVex(Graph G)
{
for (int i = 0; i < G.vexnum; i++)
{
cout << G.Vex[i] << " ";
}
cout << endl;
}
//打印图的边矩阵
void PrintEdge(Graph G)
{
for (int i = 0; i < G.vexnum; i++)
{
for (int j = 0; j < G.vexnum; j++)
{
if (G.Edge[i][j] == INF)cout << "∞ ";
else cout << G.Edge[i][j] << " ";
}
cout << endl;
}
}
//创建图功能实现函数 参数:图G InsertNode 作用:创建图
void CreateGraph(Graph& G)
{
VexType v, w;
int vn, an;//顶点数,边数
cout << "请输入顶点数目:" << endl;
cin >> vn;
cout << "请输入边数目:" << endl;
cin >> an;
cout << "请输入所有顶点名称:" << endl;
for (int i = 0; i < vn; i++)
{
cin >> v;
if (InsertNode(G, v)) continue;//插入点
else {
cout << "输入错误!" << endl; break;
}
}
cout << "请输入所有边(每行输入边连接的两个顶点及权值):" << endl;
for (int j = 0; j < an; j++)
{
int weight;
cin >> v >> w >> weight;
if (InsertEdge(G, v, w, weight)) continue;//插入边
else {
cout << "输入错误!" << endl; break;
}
}
PrintVex(G);
PrintEdge(G);
}
//广度遍历功能实现函数 参数:图G 作用:宽度遍历
void BFSTraverse(Graph G)
{
for (int i = 0; i < MaxVerNum; i++)//初始化访问标记数组
{
visited[i] = false;
}
for (int i = 0; i < G.vexnum; i++)//对每个连通分量进行遍历
{
if (!visited[i])BFS(G, i);
}
}
//深度遍历功能实现函数 参数:图G 作用:深度遍历
void DFSTraverse(Graph G)
{
for (int i = 0; i < MaxVerNum; i++)//初始化访问标记数组
{
visited[i] = false;
}
for (int i = 0; i < G.vexnum; i++)//对每个连通分量进行遍历
{
if (!visited[i])
{
DFS(G, i); cout << endl;
}
}
}
//调用最短路径-Dijkstra算法 参数:图G、源点v
void Shortest_Dijkstra(Graph& G)
{
char vname;
int v = -1;
cout << "请输入源点名称:" << endl;
cin >> vname;
for (int i = 0; i < G.vexnum; i++)
if (G.Vex[i] == vname)v = i;
if (v == -1)
{
cout << "没有找到输入点!" << endl;
return;
}
Dijkstra(G, v);
cout << "目标点" << "\t" << "最短路径值" << "\t" << "最短路径" << endl;
for (int i = 0; i < G.vexnum; i++)
{
if (i != v)
{
cout << " " << G.Vex[i] << "\t" << " " << D[i] << "\t";
Path(G, i);
cout << G.Vex[i] << endl;
}
}
}
//最小生成树-Prim算法 参数:图G
void Prim(Graph G)
{
int v = 0;//初始节点
closedge C[MaxVerNum];
int mincost = 0; //记录最小生成树的各边权值之和
//初始化
for (int i = 0; i < G.vexnum; i++)
{
C[i].adjvex = v;
C[i].lowcost = G.Edge[v][i];
}
cout << "最小生成树的所有边:" << endl;
//初始化完毕,开始G.vexnum-1次循环
for (int i = 1; i < G.vexnum; i++)
{
int k;
int min = INF;
//求出与集合U权值最小的点 权值为0的代表在集合U中
for (int j = 0; j < G.vexnum; j++)
{
if (C[j].lowcost != 0 && C[j].lowcost < min)
{
min = C[j].lowcost;
k = j;
}
}
//输出选择的边并累计权值
cout << "(" << G.Vex[k] << "," << G.Vex[C[k].adjvex] << ") ";
mincost += C[k].lowcost;
//更新最小边
for (int j = 0; j < G.vexnum; j++)
{
if (C[j].lowcost != 0 && G.Edge[k][j] < C[j].lowcost)
{
C[j].adjvex = k;
C[j].lowcost = G.Edge[k][j];
}
}
}
cout << "最小生成树权值之和:" << mincost << endl;
}
//kruskal部分,返回最小生成树的边权之和,参数n为顶点个数,m为图的边数
int kruskal(int n, int m)
{
//ans为所求边权之和,Num_Edge为当前生成树的边数
int ans = 0, Num_Edge = 0;
for (int i = 0; i < n; i++) //顶点范围是[0,n-1]
{
father[i] = i; //并查集初始化
}
sort(E, E + m, cmp); //所有边按边权从小到大排序
for (int i = 0; i < m; i++) //枚举所有边
{
int faU = findFather(E[i].u); //查询测试边两个端点所在集合的根结点
int faV = findFather(E[i].v);
if (faU != faV) //如果不在一个集合中
{
father[faU] = faV; //合并集合(即把测试边加入最小生成树中)
ans += E[i].cost; //边权之和增加测试边的边权
Num_Edge++; //当前生成树的边数加1
if (Num_Edge == n - 1)
break; //边数等于顶点数减1时结束算法
}
}
if (Num_Edge != n - 1)
return -1; //无法连通时返回-1
else
return ans; //返回最小生成树的边权之和
}
//最小生成树-Kruskal算法(克鲁斯卡尔) 参数:图
void Kruskal01() {
cout << "欢迎使用Kruskal算法" << endl;
int n, m;
cout << "请输入顶点数和边数" << endl;
scanf_s("%d%d", &n, &m); //顶点数、边数
for (int i = 0; i < m; i++)
{
cout << "请输入第" << i+1 << "条边的权值" << endl;
scanf_s("%d%d%d", &E[i].u, &E[i].v, &E[i].cost); //两个端点编号、边权
}
int ans = kruskal(n, m); //kruskal算法入口
printf_s("最短的路径为:%d\n", ans);
}
//最短路径问题—Floyd算法
void Floyd() {
cout << "欢迎使用Floyd算法!" << endl;
int a[21][21], m, n, i, j, w;
for (int i = 1; i <= 20; i++) {
for (int j = 1; j <= 20; j++) {
if (i == j) { a[i][j] = 0; }
else a[i][j] = INF;
}
}
cin >> n >> m;
cout << "顶点和边数已经输入完成" << endl;
for (int k = 1; k <= m; k++) {
cin >> i >> j >> w;
a[i][j] = w;
a[j][i] = w;
}
for (int p = 1; p <= n; p++) {
for (int i = 1; i <= n; i++) {
if (a[i][p] == INF) continue;
for (int j = 1; j <= n; j++) {
if (i == j)continue;
a[i][j] = min(a[i][j], a[i][p] + a[p][j]);
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cout << a[i][j] << " ";
}
cout << endl;
}
}
//菜单
void menu()
{
cout << "************1.创建图 2.广度遍历******************" << endl;
cout << "************3.深度遍历 4.最短路径(迪杰斯特拉)****************" << endl;
cout << "************5.最小生成树(Prim) 6.最小生成树(Kruskal) ****************" << endl;
cout << "************7.最短路径(Floyd) 8.退出程序 ****************" << endl;
// cout << "9.退出程序 ****************" << endl;
}
//主函数
int main()
{
int choice = 0;
Graph G;
InitGraph(G);
while (1)
{
menu();
printf("请输入菜单序号:\n");
scanf_s("%d", &choice);
if (8 == choice) break;
switch (choice)
{
case 1:CreateGraph(G); break;
case 2:BFSTraverse(G); break;
case 3:DFSTraverse(G); break;
//case 4:Shortest_Dijkstra(G); break;
case 4:Dijkstra(G,2); break;
case 5:Prim(G); break;
case 6:Kruskal01(); break;
case 7:Floyd(); break;
case 8:break;
default:printf("输入错误!!!\n"); break;
}
}
return 0;
}
【创建图、广度遍历和深度遍历,最短路径(迪杰斯特拉),(Prim)和(Kruskal),最短路径(Floyd)算法】
最新推荐文章于 2024-10-10 22:59:02 发布