一、实验目的
-
熟悉图的邻接矩阵、邻接表和边集数组表示
-
掌握建立图的邻接矩阵的算法
-
熟悉求图的最小生成树的普里姆算法和克鲁斯卡尔算法
二、实验内容
-
根据输入构造一个无向网络
-
输出该无向网络对应的矩阵
-
求出该无向网络的最小生成树并输出该最小生成树的所有的边
三、实验数据输入输出要求
输入示例:
5 8
ABCDE
AB 8
AC 4
AE 3
BD 8
BE 6
CD 10
CE 13
DE 12
(说明:第一对数据5 8表示共有5个顶点,共8条边,后面的AB 8表示AB边的权重为8,顶点个数不超过20,边的数目不超过50)
输出示例:
对应矩阵为:
A B C D E
A 0 8 4 ∞ 3
B 8 0 ∞ 8 6
C 4 ∞ 0 10 13
D ∞ 8 10 0 12
E 3 6 13 12 0
最小生成树对应的边为:
AE 3
AC 4
EB 6
BD 8
四、程序代码
#include <stdio.h>
#include <stdlib.h>
#define INFINITY 100000 //最大值 ∞
#define MAX_VERTEX_NUM 20 //最大顶点个数
typedef struct
{
char vexs[MAX_VERTEX_NUM]; //顶点向量
int arcs[MAX_VERTEX_NUM][MAX_VERTEX_NUM]; //邻接矩阵
int vexnum, arcnum; //图的当前顶点和弧数
} MGraph;
typedef struct
{
int adjvex;
int endvex;
int lowcost;
} closedge[MAX_VERTEX_NUM];
void CreateUDN(MGraph &G) ; //创建无向网络
int LocateVex(MGraph G, char v); //结点的在顶点向量中的下标
void PrintUDN(MGraph G); //输出存储结构示意图
void MiniSpanTree_PRIM(MGraph G,closedge &minedge); //求最小生成树的算法
void PrintMinEdge(MGraph G,closedge minedge); //输出最小生成树的边
int main()
{
MGraph G;//定义一个图的变量
closedge minedge;
CreateUDN(G);
printf("该图的邻接矩阵存储示意图如下:\n");
PrintUDN(G);
printf("\n");
MiniSpanTree_PRIM(G,minedge);
printf("该图生成树的边如下:\n");
PrintMinEdge(G,minedge);
printf("\n");
return 0;
}
void CreateUDN(MGraph &G)
{
int i, j, k, w;
char va, vb;
fscanf(stdin, "%d%d%*c", &G.vexnum, &G.arcnum); //%*c吃掉回车符
for (i = 0; i < G.vexnum; ++i) // 输入顶点名称字符
fscanf(stdin, "%c", &G.vexs[i]);
for (i = 0; i < G.vexnum; ++i) // 初始化邻接矩阵
for (j = 0; j < G.vexnum; ++j)
if (i != j)
G.arcs[i][j] = INFINITY;
else
G.arcs[i][j] = 0;
for (k = 0; k < G.arcnum; ++k)
{
fscanf(stdin, "%*c%c%c%d", &va, &vb, &w); //%*c吃掉回车符
i = LocateVex(G, va);
j = LocateVex(G, vb);
G.arcs[i][j] = G.arcs[j][i] = w; //因为是无向网
}
} //End_CreateUDN
int LocateVex(MGraph G, char v)
{
int i;
for (i = 0; i < G.vexnum; ++i)
if (v == G.vexs[i])
return i;
return -1;
}
void PrintUDN(MGraph G)
{
int i, j;
for (i = 0; i < G.vexnum; i++)
printf("\t%c", G.vexs[i]);
printf("\n");
for (i = 0; i < G.vexnum; i++)
{
printf("%c", G.vexs[i]);
for (j = 0; j < G.vexnum; j++)
if (G.arcs[i][j] < INFINITY)
printf("\t%d", G.arcs[i][j]);
else
printf("\t∞");
printf("\n");
}
}
void MiniSpanTree_PRIM(MGraph G,closedge &minedge)
{
int i,j,k,z;
int temp;
int currentmin;
k=0;
for ( j=1; j<G.vexnum; ++j ) // 辅助数组初始化
{ minedge[j-1].adjvex=k;
minedge[j-1].endvex =j;
minedge[j-1].lowcost=G.arcs[k][j];
}
for (i=0; i<G.vexnum-1; ++i)
{ currentmin=minedge[i].lowcost;
k=i;
for(j=i+1;j<G.vexnum-1;j++) //选择最小的边
{
if(minedge[j].lowcost<currentmin)
{ currentmin=minedge[j].lowcost;
k=j;
}
}
//第k个元素与第i个进行交换
temp=minedge[i].adjvex;
minedge[i].adjvex=minedge[k].adjvex;
minedge[k].adjvex=temp;
temp=minedge[i].endvex;
minedge[i].endvex=minedge[k].endvex;
minedge[k].endvex=temp;
temp=minedge[i].lowcost;
minedge[i].lowcost=minedge[k].lowcost;
minedge[k].lowcost=temp;
for (j=i+1; j<G.vexnum-1; ++j)
{
z=minedge[i].endvex ; //z为找到的新顶点
k=minedge[j].endvex;
if(k!=z)
{
if (G.arcs[z][k] < minedge[j].lowcost)
{ minedge[j].adjvex=z;
minedge[j].lowcost=G.arcs[z][k];
}
}
}
}
} // MiniSpanTree
void PrintMinEdge(MGraph G,closedge minedge)
{
int i, j;
char va, vb;
for (i = 0; i < G.vexnum - 1; i++)
{
va = G.vexs[minedge[i].adjvex];
vb = G.vexs[minedge[i].endvex];
j = G.arcs[minedge[i].adjvex][minedge[i].endvex];
printf("%c%c\t%d\n", va, vb, j);
}
}
五、运行结果及分析