学习笔记：dfs深搜

#include <iostream>
#include <vector>
#include <cstdio>

using namespace std;
using ll = long long;
const int N = 100010;

int n, m, a, b;
vector <int> gra[N];

void dfs(int u, int fa)
{
	for (auto v : gra[N])
	{
		if (v == fa) continue;
		dfs(v, u);
	}
}

int main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> m;
	for (int i = 0; i < n; i++)
	{
		cin >> a >> b;
		gra[a].push_back(b);
	}

	dfs(1, 0);
	return 0;
}