c++/c图的邻近矩阵表示

#include<iostream>
using namespace std;#define MaxVerterNum 100
typedef char VerterType;
typedef int EdgeType;
typedef struct
{VerterType vexs[MaxVerterNum]; // 存储顶点EdgeType edges[MaxVerterNum][MaxVerterNum]; // 存储邻接矩阵int n, e; // 顶点数和边数
}MGraph;void createMGraph(MGraph* G)
{// 读入顶点数和边数std::cin >> G->n >> G->e;for (int i = 0; i < G->n; ++i){//G->vexs[i] = getchar();std::cin >> G->vexs[i];}// 邻接矩阵初始化for (int i = 0; i < G->n; ++i){for (int j = 0; j < G->n; ++j){G->edges[i][j] = 0;}}// 读入e条边，建立邻接矩阵int i, j;for (int k = 0; k < G->e; ++k){//读入边<vi,vj>std::cin >> i >> j;G->edges[i][j] = 1;G->edges[j][i] = 1;}
}int main()
{MGraph* pg = new MGraph;createMGraph(pg);// 打印pg图中的节点连接情况for (int i = 0; i < pg->n; ++i){for (int j = 0; j < pg->n; ++j){std::cout << pg->edges[i][j] << "\t";}std::cout << endl;}delete pg;return 0;
}

输入

输出