Kruskal's algorithm
This function implements Kruskal's algorithm that finds a minimum spanning tree for a weighted graph
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
This function implements Kruskal's algorithm that finds a minimum spanning tree for a connected weighted graph.
It handles both directed and undirected graphs.
Lastly, we assume that the graph is labeled consecutively. That is, if there are N nodes, nodes will be labeled from 1 to N.
Cite As
Georgios Papachristoudis (2026). Kruskal's algorithm (https://www.mathworks.com/matlabcentral/fileexchange/41963-kruskal-s-algorithm), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.3.0.0 (2.71 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
