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

Highly Connected Graph check is unweighted #2

Open
zwelz3 opened this issue Aug 13, 2021 · 0 comments
Open

Highly Connected Graph check is unweighted #2

zwelz3 opened this issue Aug 13, 2021 · 0 comments

Comments

@zwelz3
Copy link

zwelz3 commented Aug 13, 2021

The check for connectivity uses the networkx minimum_edge_cut, which appears to be for unweighted graphs.

I believe the algorithm for weighted graphs is networkx.algorithms.connectivity.stoerwagner.
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
@zwelz3