2.25 图_BFS

2️⃣5️⃣ 图_BFS

#include <iostream>
#include <stack>
#include <queue>
using namespace std;
#define MAX_VERTS 20

class Vertex //顶点
{
public:
	Vertex(char lab): Label(lab) , wasVisited(0) {}
public:
	bool wasVisited;
	char Label;
};

class Graph
{
public:
	Graph();
	~Graph();
	void addVertex(char lab);
	void addEdge(int start, int end);
	void printMatrix();
	void showVertex(int v);
	void DFS();//深度优先搜索
	void BFS();//广度优先搜索
private:
	Vertex* vertexList[MAX_VERTS];
	int nVerts;
	int adjMat[MAX_VERTS][MAX_VERTS];
	int getAdjUnvisitedVertex(int v);
};

void Graph::DFS(){
	stack<int> gStack;
	vertexList[0]->wasVisited = true;
	showVertex(0);
	gStack.push(0);
	int v;
	while(gStack.size()>0){
		v = getAdjUnvisitedVertex(gStack.top());
		if(v==-1)
			gStack.pop();
		else{
			vertexList[v]->wasVisited = true;
			showVertex(v);
			gStack.push(v);
		}
	}
	cout << endl;
	for(int j=0; j!=nVerts; j++)
		vertexList[j]->wasVisited = false;
}

void Graph::BFS(){
	queue<int> gQueue;
	vertexList[0]->wasVisited = true;
	showVertex(0);
	gQueue.push(0);
	int vert1, vert2;
	while(gQueue.size()>0){
		vert1 = gQueue.front();
		gQueue.pop();
		vert2 = getAdjUnvisitedVertex(vert1);
		while(vert2!=-1){
			vertexList[vert2]->wasVisited = true;
			showVertex(vert2);
			gQueue.push(vert2);
			vert2 = getAdjUnvisitedVertex(vert1);
		}
	}
	cout << endl;
	for(int j=0; j!=nVerts; j++)
		vertexList[j]->wasVisited = false;
}

int Graph::getAdjUnvisitedVertex(int v){
	for(int j=0; j!=MAX_VERTS; j++)
		if((adjMat[v][j]==1)&&(vertexList[j]->wasVisited==false))
		return j;
	return -1;
}

void Graph::showVertex(int v){
	cout << vertexList[v]->Label << " ";
}

Graph::Graph(){
	nVerts = 0;
	for(int i=0; i!=MAX_VERTS; i++)
		for(int j=0; j!=MAX_VERTS; j++)
			adjMat[i][j]=0;
}

void Graph::addVertex(char lab){
	vertexList[nVerts++] = new Vertex(lab);
}

void Graph::addEdge(int start, int end){
	adjMat[start][end] = 1;
	adjMat[end][start] = 1;
}

void Graph::printMatrix(){
	for(int i=0; i!=nVerts; i++){
		for(int j=0; j!=nVerts; j++){
			cout << adjMat[i][j] << " ";
		}
		cout << endl;
	}
}

Graph::~Graph(){
	for(int i=0; i!=nVerts; i++)
		delete vertexList[i];
}

int main()
{
	Graph g;
	g.addVertex('A');//0
	g.addVertex('B');//1
	g.addVertex('C');//2
	g.addVertex('D');//3
	g.addVertex('E');//4
	g.addEdge(0,1);
	g.addEdge(0,3);
	g.addEdge(1,4);
	g.addEdge(2,4);
	g.addEdge(3,4);
	g.printMatrix();
	cout << "深度优先搜索的结果：" ;
	g.DFS();
	cout << "广度优先搜索的结果：";
	g.BFS();
	return 0;
}