链式前向星dfs和bfs

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int head[N],cnt = 0;
int vis[N];
struct Edge{
    int to,next;
}e[N];
void addEdge(int u,int v){
    cnt++;
    e[cnt].to = v;
    e[cnt].next = head[u];
    head[u] = cnt;
}
void dfs(int u){
    vis[u] = 1;
    cout << u << " ";
    for(int i=head[u];i;i=e[i].next){
        if(!vis[e[i].to]){
            dfs(e[i].to);
        }
    }
}
void bfs(int u){
    vector<int> v;
    queue<int> q;
    q.push(u);
    v.push_back(u); 
    vis[u] = 1;
    while(!q.empty()){
        int t = q.front();q.pop();
        for(int i=head[t];i;i=e[i].next){
            if(!vis[e[i].to]){
                v.push_back(e[i].to);
                vis[e[i].to] = 1;
                q.push(e[i].to);
            }
        }
    }
    for(int i=0; i<v.size();i++){
        cout << v[i] << " ";
    } 
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,m;
    cin >> n >> m;
    for(int i=1; i<=m; i++){
        int u,v,w;
        cin >> u >> v;
        addEdge(u,v);
    }
    dfs(1);
    cout << endl;
    memset(vis,0,sizeof(vis));
    bfs(1);
    return 0;
}