C-Plus-Plus
C-Plus-Plus copied to clipboard
Boruvkas Algorithm
Description of Change
Implemented Boruvkas Algorithm, a greedy algorithm for finding a graphs minimums spanning tree.
Checklist
- [x] Added description of change
- [x] Added file name matches File name guidelines
- [x] Added tests and example, test must pass
- [x] Added documentation so that the program is self-explanatory and educational - Doxygen guidelines
- [x] Relevant documentation/comments is changed or added
- [x] PR title follows semantic commit guidelines
- [x] Search previous suggestions before making a new one, as yours may be a duplicate.
- [x] I acknowledge that all my contributions will be made under the project's license.
Notes: Implementation to greedily finds the Minimum Spanning Tree of a graph using Boruvka's algorithm.