A cycle in a build graph, an import graph or a task DAG turns a topological sort into an error message that usually does not say which edges are at fault. Getting the path out is not much harder than getting the boolean, and it is the only version anyone can act on. The version that looks right...

Source: [Dev.to](https://dev.to/multigrid/detecting-cycles-and-loops-in-a-dependency-graph-2eca)

Sponsored