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!
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. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
catismyfav | 2020-04-30 11:53:59 | 17 | Tiny change: 'l sorting  |
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
