【洛谷】P5318 【深基18.例3】查找文献

DFS和BFS的入门学习题目
使用set储存每个点可达的边，自动对每个点可达的点进行排序，减少后续遍历sort的耗时。
使用递归来进行DFS，使用队列queue来进行BFS

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

inline int read(){
	int s = 0, w = 1;
	char ch = getchar();
	while (ch<'0' || ch>'9'){ if (ch == '-')w = -1; ch = getchar(); }//如果输入

	while (ch >= '0'&&ch <= '9') s = s * 10 + ch - '0', ch = getchar();//输入数字并统计
	return s*w;//输出结果
}

queue<int> qList;
bool bIsUse[100005];
set<int> setNode[100005];
void dfs(int i)
{
	if (bIsUse[i])return;
	printf("%d ", i);
	bIsUse[i] = true;
	int iSize = setNode[i].size();
	set<int>::iterator it = setNode[i].begin();
	for (; it != setNode[i].end(); it++)
	{
		dfs(*it);
	}
}


void bfs(int i)
{
	qList.push(i);
	while (!qList.empty())
	{
		int node = qList.front();
		if (!bIsUse[node])
		{
			printf("%d ", node);
			bIsUse[node] = true;
			set<int>::iterator it = setNode[node].begin();
			for (; it != setNode[node].end(); it++)
			{
				if (!bIsUse[*it])
				qList.push(*it);
			}
		}
		qList.pop();
	}
	if (bIsUse[i])return;
	printf("%d ", i);
	bIsUse[i] = true;
	int iSize = setNode[i].size();
	set<int>::iterator it = setNode[i].begin();
	for (; it != setNode[i].end(); it++)
	{
		dfs(*it);
	}
}

int main()
{
	int n, m;
	cin >> n >> m;
	int a, b;
	for (int i = 0; i < m; i++)
	{
		a = read();
		b = read();
		setNode[a].insert(b);
	}
	memset(bIsUse, false, sizeof(bIsUse));
	dfs(1);
	printf("\n");
	memset(bIsUse, false, sizeof(bIsUse));
	bfs(1);
	return 0;
}