Implement Kruskal's Minimum Spanning Tree algorithm #197
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
There was a problem hiding this comment.
Pull Request Overview
This PR implements Kruskal's algorithm for finding Minimum Spanning Trees (MST) in weighted undirected graphs. The implementation uses a Disjoint Set Union data structure with path compression and union by rank optimization for efficient cycle detection.
Key changes:
- Adds complete MST algorithm with Union-Find data structure
- Includes comprehensive example demonstrating usage on a 4-vertex graph
- Follows repository standards with base R implementation and no external dependencies
Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com>
Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com>
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
Implemented Kruskal's algorithm to find the Minimum Spanning Tree (MST) of a connected, weighted, undirected graph.
Utilizes Disjoint Set Union (Union–Find) with path compression and union by rank for efficient edge merging.
Accepts edge list input (u, v, w) and number of vertices n.
Returns both the total weight and the edges included in the MST.
Added a simple example demonstrating usage with a 4-node graph.
Written in base R, with no external dependencies, consistent with repository standards.