#include <stdio.h>
#define MVNum 100
#define INFINITY 8888 //表示无穷大,顶点之间无边相连
typedef int Status; //返回值状态
typedef char VerTexType; //假设顶点的数据类型为字符型
typedef int ArcType; //假设边的权值类型为整型
//图的结构
typedef struct {
VerTexType vexs[MVNum]; //顶点表
ArcType arcs[MVNum][MVNum]; //邻接矩阵
int vexnum, arcnum; //图的当前点数和边数
} AMGraph;
//查找顶点是否在图G中
int Locate(AMGraph G, VerTexType u) {
for (int i = 0; i < G.vexnum; i++) {
if (u == G.vexs[i]) {
return i;
}
}
return -1;
}
//创建无向网
void CreatUDN(AMGraph &G) {
//1.输入顶点和边
printf("请输入顶点数和边数:");
scanf("%d,%d", &G.vexnum, &G.arcnum);
//2.输入顶点信息
printf("请输入顶点数信息:\n");
for (int i = 0; i < G.vexnum; i++) {
scanf(" %c", &G.vexs[i]); //%c之前必须有个空格,为了屏蔽换行符、空格、制表符等。
}
//3.初始化二维数组,赋值无穷大
for (int i = 0; i < G.vexnum; i++) {
for (int j = 0; j < G.vexnum; j++) {
G.arcs[i][j] = INFINITY;
}
}
//4.读入边的信息v1,v2,10
VerTexType v1, v2;
int w;
for (int k = 0; k < G.arcnum; k++) {
printf("请读入边的信息,以<顶点1,顶点2,权值>形式写入:\n");
scanf(" %c,%c,%d", &v1, &v2, &w);
int i = Locate(G, v1);
int j = Locate(G, v2);
if (i == -1 || j == -1) { //没找到顶点
printf("顶点信息不存在\n");
return;
}
//赋边的信息<i,j>
G.arcs[i][j] = w;
//赋边的信息<j,i>,无向图边存了两次
G.arcs[j][i] = w;
}
}
//--------------------------------------打印邻接矩阵----------------
void print(AMGraph G) {
for (int i = 0; i < G.vexnum; i++) {
for (int j = 0; j < G.vexnum; j++) {
printf("%d\t", G.arcs[i][j]);
}
printf("\n"); //打完一行,换一行
}
}
//---------------------------------------主函数-----------------------
int main() {
AMGraph G;
printf("开始创建网:\n");
//开始创建网
CreatUDN(G);
//邻接矩阵
printf("输出邻接矩阵为:\n");
print(G);
return 0;
}
采用邻接矩阵构建无向图最简版
最新推荐文章于 2024-08-05 08:14:20 发布