DFS&BFS模板

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;

bool edg[100][100];
bool visited[100];
vector<int> result;
int num, E;

void DFS(int u)
{
	visited[u] = true;
	result.push_back(u);
	for (int i = 0;i < num;i++)
	{
		if (visited[i] == false&&edg[i][u]==true)
			DFS(i);
	}
}

void BFS(int p)
{
	queue<int> q;
	int i;
	q.push(p);
	visited[p] = true;
	while (!q.empty())
	{
		int s = q.front();
		q.pop();
		result.push_back(s);
		for (i = 0;i < num;i++)
		{
			if (visited[i] == false && edg[i][s] == true)
			{
				q.push(i);
				visited[i] = true;
			}
		}
	}
}

int main(void)
{
	int i, j;
	memset(edg, 0, sizeof(edg));
	memset(visited, 0, sizeof(visited));
	cin >> num >> E;
	for (i = 0;i < E;i++)
	{
		int a, b;
		cin >> a >> b;
		edg[a][b] = true;
		edg[b][a] = true;
	}
	for (i = 0;i < num;i++)
	{
		if (visited[i] == 0)
		{
			DFS(i);
			for (j = 0;j < result.size();j++)
				cout << result[j] << "";
			cout << endl;
			result.clear();
		}
	}
	memset(visited, 0, sizeof(visited));
	for (i = 0;i < num;i++)
	{
		if (visited[i] == 0)
		{
			BFS(i);
			for (j = 0;j < result.size();j++)
				cout << result[j] << " ";
			cout  << endl;
			result.clear();
		}
	}
	return 0;
}

DFS（深度优先搜索）用递归；BFS（广度优先搜索）用队列。