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;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61

输入

输出