Kruskal's algorithm

Version 1.3.0.0 (2,71 ko) par Georgios Papachristoudis
This function implements Kruskal's algorithm that finds a minimum spanning tree for a weighted graph
3.5
(4)
2,3K téléchargements
Mise à jour 17 oct. 2014

Afficher la licence

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.

Citation pour cette source

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

Compatibilité avec les versions de MATLAB
Créé avec R2012b
Compatible avec toutes les versions
Plateformes compatibles
Windows macOS Linux
Catégories
En savoir plus sur Directed Graphs dans Help Center et MATLAB Answers

Community Treasure Hunt

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

Start Hunting!

Version Publié le Notes de version
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