# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 162 |
3 | adamant | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 145 |
Usually, topological sort is implemented like
void dfs(int x) {
vis[x] = true;
for(int u = 0; u < n; u++) {
if(!vis[u] && graph[x][u] == 1) {
dfs(u);
}
}
order.push_back(x);
}
And then printed in reverse order But if I implement this way
void dfs(int x) {
order.push_back(x);
vis[x] = true;
for(int u = 0; u < n; u++) {
if(!vis[u] && graph[x][u] == 1) {
dfs(u);
}
}
}
And print in same order.
Can someone provide me a test case where 2nd approach will fail
Name |
---|