Kruskal's algorithm

This function implements Kruskal's algorithm that finds a minimum spanning tree for a weighted graph
2.3K 次下载
更新时间 2014/10/17

查看许可证

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.

引用格式

Georgios Papachristoudis (2024). Kruskal's algorithm (https://www.mathworks.com/matlabcentral/fileexchange/41963-kruskal-s-algorithm), MATLAB Central File Exchange. 检索来源 .

MATLAB 版本兼容性
创建方式 R2012b
兼容任何版本
平台兼容性
Windows macOS Linux
类别
Help CenterMATLAB Answers 中查找有关 Directed Graphs 的更多信息

Community Treasure Hunt

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

Start Hunting!
版本 已发布 发行说明
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