tree/treedfs.cpp

• View this file on GitHub
• Last update: 2020-04-26 17:42:59+09:00

Code

deque<int> Q;
stack<int> s;
int cnt = 0;
vector<int> visited(n, 0), num(n);
s.emplace(0);
while(!s.empty()){
    int a = s.top(); s.pop();
    visited[a]++;
    num[a] = cnt++;
    Q.emplace_front(a);
    for (auto &&i : v[a]) {
        if(!visited[i]) s.emplace(i);
    }
}

#line 1 "tree/treedfs.cpp"
deque<int> Q;
stack<int> s;
int cnt = 0;
vector<int> visited(n, 0), num(n);
s.emplace(0);
while(!s.empty()){
    int a = s.top(); s.pop();
    visited[a]++;
    num[a] = cnt++;
    Q.emplace_front(a);
    for (auto &&i : v[a]) {
        if(!visited[i]) s.emplace(i);
    }
}

Back to top page