数据结构（七）图的遍历（递归非递归方法）

#include<iostream>
#include<stdio.h>
#include<stack>
#include<queue>
using namespace std;

typedef char VertexType;
typedef int EdgeType;

#define MAXVEX 100
#define INF 65535
bool visited[MAXVEX] ;

typedef struct Graph
{
	VertexType vexs[MAXVEX];   //顶点表
	EdgeType arc[MAXVEX][MAXVEX]; // 邻接矩阵，边表
	int vexnum, arcnum;		      //图的当前顶点数和弧数
}MGraph;

void CreateGraph(MGraph* Graph)
{
	cout << "请输入顶点数和边数："<<endl;
	cin >> Graph->vexnum >> Graph->arcnum;

	//请输入顶点
	cout << "请输入顶点" << endl;
	for (int i = 0; i < Graph->vexnum; i++)
	{
		cin >> Graph->vexs[i];
	}

	//初始化邻接矩阵
	for (int i = 0; i < Graph->vexnum; i++)
	{
		for (int j = 0; j < Graph->vexnum; j++)
		{
			Graph->arc[i][j] = INF;
		}
	}

	//输入边
	cout << "请输入边:" << endl;

	for (int i = 0; i < Graph->arcnum; i++)
	{
		int x, y, v;
		cin >> x >> y >> v;
		Graph->arc[x][y] = v;
		Graph->arc[y][x] = v;
	}


}

void print_graph(MGraph* G)
{
	for (int i = 0; i < G->vexnum; i++)
	{
		for (int j = 0; j < G->vexnum; j++)
		{

			cout << G->arc[i][j] << "\t";
		}
		cout << "\n";
	}

}

//深度遍历（递归）
void DFS(const MGraph* G, int i)
{
	visited[i] = true;
	cout << i << "\t";
	for (int j = 0; j < G->vexnum; j++)
	{
		if (!visited[j] && G->arc[i][j] != INF )
		{
			DFS(G, j);
		}
	}
}

//深度遍历(非递归)
void DFS01(const MGraph* G, int i)
{
	visited[i] = true;
	stack<int> s;
	s.push(i);
	
	while (!s.empty())
	{
		i = s.top();
		s.pop();
		cout << i << "\t";
		for (int j = 0; j < G->vexnum; j++)
		{
			if (!visited[j] && G->arc[i][j] != INF)
			{
				visited[j] = true;
				s.push(j);
				
				
			}
		}
	}

}

//广度遍历
void BFS(const MGraph* G, int i)
{
	queue<int> Q;
	Q.push(i);
	visited[i] = true;

	while (!Q.empty())
	{
		//出队列
		i = Q.front();
		Q.pop();
		cout << i << "\t";
		//入队列
		for (int j = 0; j < G->vexnum; j++)
		{
			if (!visited[j] && G->arc[i][j] != INF)
			{
				visited[j] = true;
				Q.push(j);
			}
		}
	}

}
int main()
{
	MGraph* G = new MGraph;
	CreateGraph(G);
	print_graph(G);
	BFS(G, 0);

}