邻接矩阵存储图

来源：互联网发布：程序员写博客怎么赚钱编辑：程序博客网时间：2024/05/17 00:53

#include <stdio.h>#include <stdlib.h>#define MAX_VERTEX_NUM 20typedef int AdjMatrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM];typedef struct{AdjMatrix arcs;//定义一个指向二维数组的变量int vexnum,arcnum;//图当前的顶点数和边数char vexs[MAX_VERTEX_NUM];//来存储当前的图的结点}MGraph; int LocateVex(MGraph G, char v1){//查找顶点的位置int i;for(i = 0; i < G.vexnum; i ++){if(v1 == G.vexs[i])return i;}return -1;//查找不到返回-1}void CreateAdjMatrix(MGraph &G){int i,j,k;char v1,v2;scanf("%d%d",&G.vexnum,&G.arcnum);//输入顶点数目和边的数目getchar();//吸收回车符for(i = 0; i < G.vexnum; i ++)scanf("%c",&G.vexs[i]);//输入各个顶点for(i = 0; i < G.vexnum; i ++)for(j = 0; j < G.vexnum; j ++)G.arcs[i][j] = 0;//对矩阵进行初始化for(k = 0; k < G.arcnum; k ++){getchar();scanf("%c%c",&v1,&v2);//输入边，两点确定一条直线i = LocateVex(G,v1); j = LocateVex(G,v2);//查找顶点的位置G.arcs[i][j] = G.arcs[j][i] = 1;//无向图}}void Output(MGraph G){//输出该矩阵for(int i = 0; i < G.vexnum; i ++){for(int j = 0; j < G.vexnum; j ++){printf("%3d",G.arcs[i][j]);}putchar('\n');}}int main(){MGraph G;CreateAdjMatrix(G);Output(G);return 0;}

0 0