Glossary: Algorithms Beyond the Basics in Go
Cycle
Also written: cycles
A path in a directed graph that leads back to where it started. Tasks on a cycle wait for each other forever, so they have no valid order.
Where the book teaches it
Related terms
DAG (directed acyclic graph)Topological orderKahn's algorithm