#354 Add minimum spanning tree (C++) #355
Closed
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Description
Related Issue: #354
How Has This Been Tested?
The code includes a small program that showcases the algorithms at work. It generates a random connected graph (given a number of nodes and a density percentage), runs both algorithms and measures the time they take to complete.
These implementations were originally part of a university project of mine, and I have done manual verification testing, as well as extensive performance benchmarking at that time. Currently there are no issues that I am aware of (apart from perhaps code clarity and general implementation design - I'm not that great at C++).
Screenshots
Types of changes
Bug fix (change which fixes an issue with the algorithm)
New Algorithm (non-breaking change which adds functionality)
Documentation
Checklist:
My code follows the code style of this project.
As far as I can see code style / code organisation style, I'm following it
My change requires a change to the documentation.
I have updated the documentation accordingly.
I have read the CONTRIBUTING document.