最小生成树——Prim算法(普利姆算法)
我这里为了方便就不构建其他边集合的结构了,而是直接用图存储生成的最小生成树,有需要可以自己定义相关结构!
#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;
G.arcs[y][x] = 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");
}
}
//Prim算法
//需要一个顶点集U
typedef struct {
VerTexType vex[MAXSIZE];
int length;
}UStruct;
//初始化UStruct
void InitU(UStruct& U) {
U.length = 0;
}
//判断是否在集合U中
bool IsInU(UStruct U,VerTexType x) {
for (int i = 0; i < U.length; i++)
{
if (U.vex[i]==x)
{
return true;
}
}
return false;
}
void Prim(AMGraph G,AMGraph &out,UStruct U) {
U.vex[U.length++] = G.vexs[0];//将第一个点放入U集合中
while (U.length!=G.vexnum)
{
//记录最小权重的边的两个顶点
int pointx = 0;
int pointy = 0;
ArcType min=MAXInt;
//这里代表的是找与U集合相邻的各个顶点(不在U集合中)的边的权值的最小值
for (int i = 0; i < U.length; i++)
{
//在剩下的顶点中找一个不在U中
//且与U集合中某个顶点相邻的权重最小的边的顶点
int uIndex = LocateVex(U.vex[i],G);
//这是查找本结点中的所有邻接的顶点的权值最小的边
for (int j = 0; j < G.vexnum; j++) {
if ((!IsInU(U, G.vexs[j]))&&(G.arcs[uIndex][j]!=MAXInt))//不在U集合中且相邻
{
if (min > G.arcs[uIndex][j]) {
min = G.arcs[uIndex][j];
pointx = uIndex;
pointy = j;
}
}
}
}
//找到权值最小的边加入结果集中
out.arcnum++;
out.arcs[pointx][pointy] = min;
out.arcs[pointy][pointx] = min;
//必定是一个顶点在U集中一个不在,这里是表明将不在U集合中的顶点加入到U集中
if (!IsInU(U,G.vexs[pointx]))
{
U.vex[U.length++] = G.vexs[pointx];
}
else {
U.vex[U.length++] = G.vexs[pointy];
}
}
}
int main() {
AMGraph G;
createUDN(G);
outPut(G);
//初始化存放生成树的图结构的顶点
AMGraph out;
//设置输出的生成树的顶点数与原图相同
out.vexnum = G.vexnum;
for (int i = 0; i < G.vexnum; i++)
{
out.vexs[i] = G.vexs[i];
}
//对邻接矩阵进行初始化
for (int i = 0; i < out.vexnum; i++) {
for (int j = 0; j < out.vexnum; j++) {
out.arcs[i][j] = MAXInt;
}
}
UStruct U;
InitU(U);
Prim(G, out, U);
outPut(out);
return 0;
}
测试样例: