#1代码 ##1.1创建图的邻阶矩阵
void CreateMGraph(MGraph &g, int n, int e)//建图
{
int x,y;
//初始化邻接矩阵
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
g.edges[i][j] = 0;
}
}
for(int i=0;i
cin>>x>>y;
g.edges[x][y] = 1;//对称矩阵
g.edges[y][x] = 1;
}
g.n=n;
}
##1.2以邻接矩阵为存储结构遍历算法 ###深度优先遍历
void DFS(MGraph g, int v)//深度遍历
{
static int n = 0;
int j;
if (!visited[v]) {
if (!n) {
cout << v;
n++;
}
else
cout << ' ' << v;
visited[v] = 1;
}
for (j = 1; j <= g.n; j++) {
if (!visited[j] && g