| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | adamant | 157 |
| 6 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | djm03178 | 153 |
Cycles in a graph
Let's you have a graph with n nodes and m bi-directional edges. (n, m <= 1e5). How would I get the cycles in this graph in an efficient way using DFS.
BTW, I've linked an image where I drew what I thought is a cycle. If it's not a cycle, please tell me what a cycle actually is.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
tgp07 | 2022-05-20 05:49:38 | 26 | Tiny change: '\nhttps://codeforces.me/5a7fab' -> '\nhttps://imgur.com/a/Qrrg8DF' | |
| en4 |
|
tgp07 | 2022-05-20 02:54:28 | 3 | Tiny change: 'com/5a7fab/\n' -> 'com/5a7fab' | |
| en3 |
|
tgp07 | 2022-05-20 02:54:01 | 77 | ||
| en2 |
|
tgp07 | 2022-05-20 02:53:18 | 69 | ||
| en1 |
|
tgp07 | 2022-05-20 02:52:48 | 299 | Initial revision (published) |
