06-图1 列出连通集 (25 分)（C++）

06-图1 列出连通集 (25 分)（C++）

题目

给定一个有N个顶点和E条边的无向图，请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N−1编号。进行搜索时，假设我们总是从编号最小的顶点出发，按编号递增的顺序访问邻接点。

输入格式:
输入第1行给出2个整数N(0<N≤10)和E，分别是图的顶点数和边数。随后E行，每行给出一条边的两个端点。每行中的数字之间用1空格分隔。

输出格式:
按照"{ v​1 v2 v3…vk }"的格式，每行输出一个连通集。先输出DFS的结果，再输出BFS的结果。

输入样例:
8 6
0 7
0 1
2 0
4 1
2 4
3 5
输出样例:
{ 0 1 4 2 7 }
{ 3 5 }
{ 6 }
{ 0 1 2 7 4 }
{ 3 5 }
{ 6 }

C++代码

#include<iostream>
#define QUEUESIZE 20
using namespace std;

struct Graph
{
	int Vnum;//节点数
	int Enum;//边数
	int** p;//邻接表
	bool* Visit;//是否被访问
}graph;
typedef struct Queue Queue;
struct Queue
{
	int front;
	int rear;
	int q[QUEUESIZE];
};
Queue* CreatQueue()
{
	Queue* Q = new Queue;
	Q->front = 0;
	Q->rear = 0;
	return Q;
}
void Add(Queue* Q, int num)
{
	Q->rear = (Q->rear + 1) % QUEUESIZE;
	Q->q[Q->rear] = num;
}
bool IsEmpty(Queue* Q)
{
	return (Q->front == Q->rear) ? true : false;
}
int Delete(Queue* Q)
{
	if (!IsEmpty(Q))
	{
		Q->front = (Q->front + 1) % QUEUESIZE;
		return Q->q[Q->front];
	}

	else return -1;
}
void DFS(int V)
{
	graph.Visit[V] = true;
	cout << V << " ";
	for (int i = 0; i < graph.Vnum; i++)
	{
		if (graph.p[V][i] && !graph.Visit[i])
			DFS(i);
	}
}
void BFS(int V)
{
	Queue* Q = CreatQueue();
	Add(Q, V);
	graph.Visit[V] = true;
	while (!IsEmpty(Q))
	{
		V = Delete(Q);
		
		cout << V << " ";
		for (int i = 0; i < graph.Vnum; i++)
		{
			if (graph.p[V][i] && !graph.Visit[i])
			{
				graph.Visit[i] = true;
				Add(Q, i);
			}
				
		}
	}
}
void ClearVisit()
{
	for (int i = 0; i < graph.Vnum; i++)
		graph.Visit[i] = false;
}
int main()
{
	
	cin >> graph.Vnum >> graph.Enum;
	graph.p = new int*[graph.Vnum] {0};
	graph.Visit = new bool[graph.Vnum]{ 0 };
	for (int i = 0; i < graph.Vnum; i++)
		graph.p[i] = new int[graph.Vnum] {0};
	int m = 0, n = 0;
	for (int i = 0; i < graph.Enum; i++)
	{
		cin >> m >> n;
		graph.p[m][n] = graph.p[n][m] = 1;
	}
	for (int i = 0; i < graph.Vnum; i++)
	{
		if (!graph.Visit[i])
		{
			cout << "{ ";
			DFS(i);
			cout << "}" << endl;
		}
	}
	ClearVisit();
	for (int i = 0; i < graph.Vnum; i++)
	{
		if (!graph.Visit[i])
		{
			cout << "{ ";
			BFS(i);
			cout << "}" << endl;
		}
	}
	ClearVisit();
	system("pause");
	return 0;
}