Look into circular dependency algorithm
OmarTawfik opened this issue · comments
A DFS might be inefficient, and it will struggle to produce exactly one error for each cycle.
Look into switching to something similar to soniakeys/graph, a Go package, which implements Johnson's algorithm for finding cycles.