№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 172 |
2 | adamant | 164 |
3 | awoo | 163 |
4 | TheScrasse | 160 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
9 | pajenegod | 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
Название |
---|