Hello all! I have started studying dfs and it's applications and I was studying topological sorting . I am stuck at the part to check the graph is Acyclic or not? Can anyone help with any easier way to check this? Thanks!
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 163 |
2 | cry | 161 |
3 | maomao90 | 160 |
4 | -is-this-fft- | 159 |
5 | awoo | 158 |
5 | atcoder_official | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 149 |
Help Needed in Cycle Detection in Graphs
Hello all! I have started studying dfs and it's applications and I was studying topological sorting . I am stuck at the part to check the graph is Acyclic or not? Can anyone help with any easier way to check this? Thanks!
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en2 | catismyfav | 2020-04-30 11:53:59 | 17 | Tiny change: 'l sorting ![ This problem ](https://w' -> 'l sorting (https://w' | ||
en1 | catismyfav | 2020-04-30 11:53:12 | 323 | Initial revision (published) |
Название |
---|