邻接矩阵 深度广度遍历

#include<iostream>
#include<iomanip>
#include<queue>
using namespace std;
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define MAXVEX 100
#define INFINITY 8888
#define MAXSIZE 9
typedef int Status;
typedef char VertexType;
typedef int Boolean;
Boolean visited[MAXVEX];
typedef  struct
{
char vexs[MAXVEX]; //顶点表
int arc[MAXVEX][MAXVEX];//邻接矩阵，边表
int numVertexes;int numEdges;//顶点数 和边数
}MGraph;
queue<int>q;
void CreateMGraph(MGraph *G)
{
int i, j, k;

cout << "输入顶点数：";
cin >> G->numVertexes;
cout << "请输入边数：";
cin >> G->numEdges;
cout << "请输入顶点信息：" << endl;
for (i = 1; i <= G->numVertexes; i++)
cin >> G->vexs[i];
for (i = 1; i <= G->numVertexes;i++)
for (j = 1; j <=G->numVertexes; j++)
G->arc[i][j] = 0;
for (k = 1; k <=G->numEdges; ++k)
{
cout << "输入第"<<k<<"条边的下标（i，j）:"<< endl;
cin >> i >> j ;
G->arc[i][j] = 1; 
G->arc[j][i] = G->arc[i][j];
}
cout << "邻接矩阵为：" << endl;
for (i = 1; i <= G->numVertexes; i++)
cout<<"    "<<G->vexs[i];
cout << endl;
for (i = 1; i <= G->numVertexes; i++)
{
cout << G->vexs[i]<<"   ";
for (j = 1; j <= G->numVertexes; j++)
cout << G->arc[i][j]<<"    ";
cout << endl;
}

}
void DFS(MGraph *G, int i)
{
int j; 
visited[i] = TRUE;
cout << G->vexs[i]<<" ";

for (j = 1; j <=G->numVertexes; j++)
{


if (G->arc[i][j] == 1 && !visited[j])
DFS(G, j);
}
}
void DFSTraverse(MGraph *G)
{
cout << "深度优先遍历结果为：" << endl;
int i;
for (i = 1; i <= G->numVertexes; i++)
visited[i] = FALSE;
for (i = 1; i <= G->numVertexes; i++)
if (!visited[i])
DFS(G, i);
cout << endl;
}
void BFS(MGraph *G,int i)
{
int j,k;
visited[i] =TRUE;
cout << G->vexs[i] << " ";
q.push(i);
while (!q.empty())
{
k = q.front();
q.pop();
for (j = 1; j <= G->numVertexes; j++)
{
if (G->arc[k][j] != 0 && visited[j]==FALSE)
{
cout << G->vexs[j] << " ";
visited[j] = TRUE;
q.push(j);
}
}
}





}
void BFSTraverse(MGraph *G)
{
cout << "广度优先遍历结果：" << endl;
int i;
for (i = 1; i <= G->numVertexes; i++)
visited[i] = FALSE;
for (i = 1; i <= G->numVertexes; i++)
if (!visited[i])
BFS(G, i);
cout << endl;
}
int main()
{
MGraph *G; 
G = (MGraph*)malloc(sizeof(MGraph));
CreateMGraph(G);
DFSTraverse(G);
BFSTraverse(G);
system("pause");
return 0;
}