Closed williamabreu closed 3 years ago
stale[bot]
commented
3 years ago This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.
sky3760000
commented
3 years ago hello ima beginner and i found a typo error of adjecency in test graph sub file should i make pull request
stale[bot]
commented
3 years ago This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.
stale[bot]
commented
3 years ago Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!
While comparing the outputs from the "minimum_spanning_tree_kruskal2.py" with the simple "minimum_spanning_tree_kruskal.py" for a big graph, I figured out the bad comportment of the algorithm.
I've modified the code to return the cost of the MST (sum of all edge-weights), and seed the input with this:
number of vertexes = 1497 number of edges = 10000
The following are triples (u, v, w), where u and v are vertexes and w the weight of the edge (u, v)...
And the result for "minimum_spanning_tree_kruskal.py" is 612543 and for "minimum_spanning_tree_kruskal2.py" is 613624.
I've tested with other models and the version 1 is fine, only the version 2 isn't working.