Adding implementation for the Boruvka algorithm (finding minimum span…
Description of Change
In this Pull Request I provide an implementation for the Boruvka algorithm for finding minimum spanning trees. I also provide a test function and a code-block for executing it on graphs provided by the user interactively.
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.
@Panquesito7 @realstealthninja let me know if any changes are needed, this is an implementation + tests for Boruvka MST algorithm.
Cool fact: This was the first algorithm invented for this particular problem, which is super relevant even today (:
@vil02 can you approve my workflows?
@vil02 can you approve my workflows?
I am afraid that only the maintainers of this repository can do that (@realstealthninja, @Panquesito7 could you approve them?).
@FranciscoThiesen if you like I can review your code.
@Panquesito7 waiting for review (:
@vil02 do you have an idea about how to get this reviewed/merged?
@vil02 do you have an idea about how to get this reviewed/merged?
@FranciscoThiesen I have no idea. I guess the maintainers are busy with some tsunami of pull-requests. I have to admit that since the beginning of this month I have an allergy to github.
This pull request has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.
Please ping one of the maintainers once you commit the changes requested or make improvements on the code. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!