| commit | 48795b6460e16dff72add0675a7bf8e1f029108e | [log] [tgz] |
|---|---|---|
| author | Tim Peters <tim.peters@gmail.com> | Wed Jan 21 01:28:48 2026 |
| committer | GitHub <noreply@github.com> | Wed Jan 21 01:28:48 2026 |
| tree | c82042fb881f8e0522266fe8347281f5be0db6ac | |
| parent | 95746b3a13a985787ef53b977129041971ed7f70 [diff] |
GH-143948: Explain graphlib's cycle-finding code (#143950) Explain topsort's cycle-finding algorithm, and why it's written that way. Co-authored-by: Bénédikt Tran <10796600+picnixz@users.noreply.github.com>