feat(graph): add kruskal and strong components detection #62
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This commit introduces a new Disjoint Set (Union-Find) data structure to the module. - Added and implementing the Disjoint Set with , , (with path compression), and (with union by rank). - Updated to include the new source files and ensure proper compilation of dependencies. - Added comprehensive unit tests for the Disjoint Set functionality in .
ryukinix
force-pushed
the
add-more-graph-algorithms
branch
from
649c6f7 to
d809da7
Compare
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Notes: I should update the documentation to include the last graph
algorithms... maybe the README.md could be unified with the main page
of doxygen, currently is kinda duplicated.