以下是我的代码

#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > g;
vector<bool> v;
void dfs(int s) 
{
    v[s] = true;
    cout<<s<<" ";
    for (int i : g[s]) 
	{
        if (!v[i]) 
		{
            dfs(i);
        }
    }
}

void bfs(int s) 
{
    queue<int> q;
    q.push(s);
    v[s] = true;
    while (!q.empty()) 
	{
        int vv = q.front();
        q.pop();
        cout << vv << " ";
        for (int i : g[vv]) 
		{
            if (!v[i]) 
			{
                v[i] = true;
                q.push(i);
            }
        }
    }
}

int main() {
    int n, m;
    cin >> n >> m;
    g.resize(n + 1);
    v.resize(n + 1, false);
    for (int i = 0; i < m; i++) 
	{
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
    }

    dfs(1);
    cout << endl;

    v.assign(n + 1, false);
    bfs(1);
    cout << endl;

    return 0;
}