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.

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

kruskal issue #2

Open
babyYaoyuan opened this issue Jul 9, 2020 · 1 comment
Open

kruskal issue #2

babyYaoyuan opened this issue Jul 9, 2020 · 1 comment

Comments

@babyYaoyuan
Copy link

The loop condition in 'kruskal.py' is:
while len(visited) < len(nodes):
If the code have visited all the nodes, the whole algorithm will end.
But if the code generate some subgraph that does not connect, the algorithm will also end.

@ma-shangao
Copy link

The loop condition in 'kruskal.py' is:
while len(visited) < len(nodes):
If the code have visited all the nodes, the whole algorithm will end.
But if the code generate some subgraph that does not connect, the algorithm will also end.

Also met this problem

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants