This repository has been archived by the owner on Jun 15, 2021. It is now read-only.
Look into circular dependency algorithm #78
Comments
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
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.The text was updated successfully, but these errors were encountered: