Kruskal's algorithm

Versione 1.3.0.0 (2,71 KB) da Georgios Papachristoudis
This function implements Kruskal's algorithm that finds a minimum spanning tree for a weighted graph
3.5
(4)
2,3K download
Aggiornato 17 ott 2014

Visualizza la licenza

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.

Cita come

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

Compatibilità della release di MATLAB
Creato con R2012b
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Categorie
Scopri di più su Directed Graphs in Help Center e MATLAB Answers

Community Treasure Hunt

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

Start Hunting!

Versione Pubblicato Note della release
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