Help for this page
Returns a cycle if the graph has one (as a list of vertices), an e
+mpty list if no cycle can be found.
Note that this just returns the vertices of a cycle: not any parti
+cular cycle, just the first one it finds. A repeated call might find
+the same cycle, or it might find a different one, and you cannot call
+ this repeatedly to find all the cycles.
Priority 1, Priority 2, Priority 3
Priority 1, Priority 0, Priority -1
Urgent, important, favour
Data loss, bug, enhancement
Out of scope, out of budget, out of line
Family, friends, work
Impossible, inconceivable, implemented
Results (276 votes),