Explain graphlib's cycle-finding code #143948
Description
Feature or enhancement
Proposal:
The topsort in graphlib has a novel iterative cycle-finding algorithm that's O() time- and space- optimal. It's not obvious, though, and it's overdue for me to explain it. So add appropriate comments.
Has this already been discussed elsewhere?
This is a minor feature, which does not need previous discussion elsewhere
Links to previous discussion of this feature:
No response