* Boruvkas Algorithm Implementation Implemented Boruvkas Algorithm under graphs as a means for finding the minimums spanning tree * Boruvkas Algorithm Implementation Implemented Boruvkas algorithm, a greedy algorithm to find a graphs minimum spanning tree. * Update climits limits.h to climits Co-authored-by: David Leal <halfpacho@gmail.com> * Fixes for maintainability Made changes as recommended by Panquesito7 for maintainability and security * Fixed boruvkas main Made suggested changes Co-authored-by: David Leal <halfpacho@gmail.com> * Suggested changes for Boruvkas Changed from graph to greedy algorithm, removed the extra main(), general fixes * Update Boruvkas readability, CI Workflow General readability changes, change push_back to implace_back * Update Boruvkas memory allocation Added pre-allocation of memory for the parent vector of Boruvkas * Fixed file name, added namespace Fixed file name, added Boruvkas namespace, made suggested changes * Update boruvkas spacing Fixed spacing hopefully * Update boruvkas spacing Fixing weird tabs * Update Boruvkas tabs spacings Finally done with spacing i think * Boruvkas - Finished spacing Triplle checked tabs/spaces * chore: apply suggestions from code review * fix: CI issues (hopefully) * fix: last fix Co-authored-by: David Leal <halfpacho@gmail.com>
The Algorithms - C++
Overview
This repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under MIT License. These algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and the associated documentation are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using a different algorithm strategies and optimizations.
Features
- The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - C++.
- Well documented source code with detailed explanations provide a valuable resource for educators and students alike.
- Each source code is atomic using STL classes and no external libraries are required for their compilation and execution. Thus, the fundamentals of the algorithms can be studied in much depth.
- Source codes are compiled and tested for every commit on the latest versions of three major operating systems viz., Windows, MacOS and Ubuntu (Linux) using MSVC 16 2019, AppleClang 11.0 and GNU 7.5.0 respectively.
- Strict adherence to C++11 standard ensures portability of code to embedded systems as well like ESP32, ARM Cortex, etc. with little to no changes.
- Self-checks within programs ensure correct implementations with confidence.
- Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications.
Documentation
Online Documentation is generated from the repository source codes directly. The documentation contains all resources including source code snippets, details on execution of the programs, diagrammatic representation of program flow, and links to external resources where necessary. The documentation also introduces interactive source code with links to documentation for C++ STL library functions used. Click on Files menu to see the list of all the files documented with the code.
Documentation of Algorithms in C++ by The Algorithms Contributors is licensed under CC BY-SA 4.0
Contributions
As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines.