We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
We should provide an algorithm for cycle detection that works for both directed and undirected (and mixed) graphs.
Consider basing it on #8.
Besides merely detecting cycles, it would be nice to also return Cycle instances, similar to how DetectNegativeCycle works.
Cycle
DetectNegativeCycle
http://en.wikipedia.org/wiki/Cycle_%28graph_theory%29#Cycle_detection
The text was updated successfully, but these errors were encountered:
See #119.
Sorry, something went wrong.
Algorithms will be split off via #119, issue migrated to graphp/algorithms#2
No branches or pull requests
We should provide an algorithm for cycle detection that works for both directed and undirected (and mixed) graphs.
Consider basing it on #8.
Besides merely detecting cycles, it would be nice to also return
Cycle
instances, similar to howDetectNegativeCycle
works.http://en.wikipedia.org/wiki/Cycle_%28graph_theory%29#Cycle_detection
The text was updated successfully, but these errors were encountered: