Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

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

Jump to bottom

fix fundamental cycles #141

Open
mpadge opened this issue Jul 21, 2020 · 1 comment
Open

fix fundamental cycles #141

mpadge opened this issue Jul 21, 2020 · 1 comment

Comments

@mpadge
Copy link
Member

mpadge commented Jul 21, 2020 •
edited
Loading

The current code does not return a minimal cycle basis at all. Maybe implement the same algorithm as networkx (with code here), which is described in this paper (direct pdf link here). Another possibility is described in this arXiv paper. Here is also Johnson's original 1975 paper, Finding all the elementary circuits of a directed graph.
@mpadge
Copy link
Member Author

mpadge commented Sep 12, 2024

https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/findloop/ - especially the last algorithm, Tarjan's Bridge-finding algorithm, looks sound.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@mpadge