#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;
}

輸入

輸出