Kruskal's algorithm

This function implements Kruskal's algorithm that finds a minimum spanning tree for a weighted graph
2.3K Downloads
Updated 17 Oct 2014

View License

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 (2024). Kruskal's algorithm (https://www.mathworks.com/matlabcentral/fileexchange/41963-kruskal-s-algorithm), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2012b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Directed Graphs in Help Center and MATLAB Answers

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes
1.3.0.0

Just updated the image pic.

1.2.0.0

I just updated the image

1.1.0.0

Just updated the description of the file.

1.0.0.0