# Kruskal Algorithm

Version 1.0.0.0 (3.11 KB) by
Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connect
Updated 20 Dec 2006

Kruskal's algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected un directed weighted graph

The zip file contains

kruskal.m iscycle.m fysalida.m connected.m

If we want to find the minimum spanning tree. We call function kruskal.

% Input: PV = nx3 martix. 1st and 2nd row's define the edge (2 vertices) and
% the 3rd is the edge's weight
% Output: w = Minimum spanning tree's weight
% T = Minimum spanning tree's adjacency matrix

example :

>>PV = PV = [ 1 2 5;1 3 8;1 5 10;2 3 10;3 4 4;3 5 7;4 5 6];

>>[w T] = kruskal(PV)

w =

23

T =

0 1 1 0 0
1 0 0 0 0
1 0 0 1 0
0 0 1 0 1
0 0 0 1 0

### Cite As

Nickolas Cheilakos (2024). Kruskal Algorithm (https://www.mathworks.com/matlabcentral/fileexchange/13457-kruskal-algorithm), MATLAB Central File Exchange. Retrieved .

##### MATLAB Release Compatibility
Created with R13
Compatible with any release
##### Platform Compatibility
Windows macOS Linux
##### Categories
Find more on Graph and Network Algorithms in Help Center and MATLAB Answers