Kruskal Algorithm
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
引用
Nickolas Cheilakos (2024). Kruskal Algorithm (https://www.mathworks.com/matlabcentral/fileexchange/13457-kruskal-algorithm), MATLAB Central File Exchange. 取得済み .
MATLAB リリースの互換性
プラットフォームの互換性
Windows macOS Linuxカテゴリ
タグ
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!MST_Kruskal/
バージョン | 公開済み | リリース ノート | |
---|---|---|---|
1.0.0.0 |