Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

Cycles in a graph
Difference between en1 and en2, changed 69 character(s)
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.↵
↵
/predownloaded/d3/9f/d39ffb7a821d52f55930893ee7667e980def82ad.png

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English tgp07 2022-05-20 05:49:38 26 Tiny change: '\nhttps://mirror.codeforces.com/5a7fab' -> '\nhttps://imgur.com/a/Qrrg8DF'
en4 English tgp07 2022-05-20 02:54:28 3 Tiny change: 'com/5a7fab/\n' -> 'com/5a7fab'
en3 English tgp07 2022-05-20 02:54:01 77
en2 English tgp07 2022-05-20 02:53:18 69
en1 English tgp07 2022-05-20 02:52:48 299 Initial revision (published)