邻接矩阵
emmm,由于考虑到图是由顶点和弧两部分组成,合在一起比较困难,所以就考虑分到两个结构来分别存储,顶点不分大小,主次,所以用一个一维数组来存即可,而边或弧由于是顶点和顶点之间的关系,所以用二维数组来存.
二维数组存储数据的大小由什么来决定呢?
由顶点数目来决定,顶点数是n,这个二维数组就是n*n的矩阵
我们先要来定义图的结构
typedef char VertexType;
typedef enum {
DG, UDG//有向图,无向图
}GraphType;
typedef struct {
VertexType vexs[MAX_VER_NUM];//顶点数组
int arcs[MAX_VER_NUM][MAX_VER_NUM];//邻接矩阵
int vexnum, arcnum;//图当前的顶点数和弧数
GraphType type;
}MGraph;
接下来就要创建邻接矩阵
创建邻接矩阵需要知道顶点数,弧数,以及连接弧的两个顶点信息,知道顶点信息后,就要将邻接矩阵的对应的位置改为1,所以要根据两个顶点,找到它们在一维数组中的索引,并将对应的二维数组的值赋为1,这样就表示了这两个顶点相关联
void create_MG(MGraph* MG) {
int i, j, k;
int v1, v2, type;
char c1, c2;
printf("请输入图的类型:(有向0,无向1)\n");
scanf("%d", &type);
if (type == 0)
MG->type = DG;
else
MG->type = UDG;
printf("请输入顶点数:\n");
scanf("%d", &MG->vexnum);
printf("请输入弧数:\n");
scanf("%d", &MG->arcnum);
printf("请输入顶点;\n");
getchar();
for (i = 1; i <= MG->vexnum; i++) {
scanf("%c", &MG->vexs[i]);
}
//初始化邻接矩阵
for (i = 1; i <= MG->vexnum; i++) {
for (j = 1; j <= MG->vexnum; j++)
MG->arcs[i][j] = 0;
}
for (k = 1; k <= MG->arcnum; k++) {
printf("请输入%d条边的两个顶点\n", k);
rewind(stdin);
scanf("%c %c", &c1, &c2);
v1 = getIndexofVexs(c1, MG);
v2 = getIndexofVexs(c2, MG);
if (MG->type == 1) {//如果是有向图,两个都要标记
MG->arcs[v1][v2] = MG->arcs[v2][v1] = 1;
}//无向图只用标记一个
else MG->arcs[v1][v2] = 1;
}
}
确定数组下标的代码如下
int getIndexofVexs(char vex, MGraph* MG) {
int i;
for (i = 1; i <= MG->vexnum; i++) {
if (MG->vexs[i] == vex)
return i;
}
return 0;
}
接着就是打印:
void print_MG(MGraph MG) {
int i, j;
if (MG.type == DG)
printf("该图是有向图");
else printf("该图是无向图");
printf("图顶点的数量为:\n%d\n", MG.vexnum);
printf("图边的数量为:\n%d\n", MG.arcnum);
printf("图的顶点信息为:\n");
for (i = 1; i <= MG.vexnum; i++)
printf("%c", MG.vexs[i]);
printf("\n");
printf("图的边的信息为:\n");
for (i = 1; i <= MG.vexnum; i++) {
for (j = 1; j <= MG.vexnum; j++)
printf("%d", MG.arcs[i][j]);
printf("\n");
}
}
完整代码如下
#include<stdio.h>
#include<stdlib.h>
#define MAX_VER_NUM 50
typedef char VertexType;
typedef enum {
DG, UDG//有向图,无向图
}GraphType;
typedef struct {
VertexType vexs[MAX_VER_NUM];//顶点数组
int arcs[MAX_VER_NUM][MAX_VER_NUM];//邻接矩阵
int vexnum, arcnum;//图当前的顶点数和弧数
GraphType type;
}MGraph;
//找到指定顶点在顶点集合中的下标
int getIndexofVexs(char vex, MGraph* MG) {
int i;
for (i = 1; i <= MG->vexnum; i++) {
if (MG->vexs[i] == vex)
return i;
}
return 0;
}
//创建邻接矩阵
void create_MG(MGraph* MG) {
int i, j, k;
int v1, v2, type;
char c1, c2;
printf("请输入图的类型:(有向0,无向1)\n");
scanf("%d", &type);
if (type == 0)
MG->type = DG;
else
MG->type = UDG;
printf("请输入顶点数:\n");
scanf("%d", &MG->vexnum);
printf("请输入弧数:\n");
scanf("%d", &MG->arcnum);
printf("请输入顶点;\n");
getchar();
for (i = 1; i <= MG->vexnum; i++) {
scanf("%c", &MG->vexs[i]);
}
//初始化邻接矩阵
for (i = 1; i <= MG->vexnum; i++) {
for (j = 1; j <= MG->vexnum; j++)
MG->arcs[i][j] = 0;
}
for (k = 1; k <= MG->arcnum; k++) {
printf("请输入%d条边的两个顶点\n", k);
rewind(stdin);
scanf("%c %c", &c1, &c2);
v1 = getIndexofVexs(c1, MG);
v2 = getIndexofVexs(c2, MG);
if (MG->type == 2) {//无向图两个都要标记
MG->arcs[v1][v2] = MG->arcs[v2][v1] = 1;
}//有向图只用标记一个
else MG->arcs[v1][v2] = 1;
}
}
//打印邻接矩阵和顶点的信息
void print_MG(MGraph MG) {
int i, j;
if (MG.type == DG)
printf("该图是有向图");
else printf("该图是无向图");
printf("图顶点的数量为:\n%d\n", MG.vexnum);
printf("图边的数量为:\n%d\n", MG.arcnum);
printf("图的顶点信息为:\n");
for (i = 1; i <= MG.vexnum; i++)
printf("%c", MG.vexs[i]);
printf("\n");
printf("图的边的信息为:\n");
for (i = 1; i <= MG.vexnum; i++) {
for (j = 1; j <= MG.vexnum; j++)
printf("%d", MG.arcs[i][j]);
printf("\n");
}
}
int main(void) {
MGraph MG;
create_MG(&MG);
print_MG(MG);
return 0;
}
这就是测试点信息