Maximum Weight Spanning tree (Undirected)

Versione 1.6.0.0 (2,67 KB) da Guangdi Li
Chu-Liu-Edmonds Algorithm for learning "Undirected Maximum Weight Spanning tree" is proposed here.
4.3
(3)
3,4K download
Aggiornato 11 giu 2009

Visualizza la licenza

This algorithm is based on two papers:
Chu-Liu-Edmonds Algorithm:
Y. J. Chu and T. H. Liu, ``On the shortest arborescence of a directed graph'', Science Sinica, v.14, 1965, pp.1396-1400.
J. Edmonds, ``Optimum branchings'', J. Research of the National Bureau of Standards, 71B, 1967, pp.233-240.

The code can be easily changed to consider minimum weight spanning tree.

Please open "ControlCentor.m" at first. there is an example for understanding....If there is any question or problem, please let me know, i will help you as soon as possible.

Cita come

Guangdi Li (2024). Maximum Weight Spanning tree (Undirected) (https://www.mathworks.com/matlabcentral/fileexchange/23276-maximum-weight-spanning-tree-undirected), MATLAB Central File Exchange. Recuperato .

Compatibilità della release di MATLAB
Creato con R2008a
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Categorie
Scopri di più su Undirected 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!

MaximumSpanningTree/

Versione Pubblicato Note della release
1.6.0.0

Make it more simple
1.4.0.0

The description for this algorithm is not so clear that I revise it again
1.1.0.0

Some files are missing, thanks ..
1.0.0.0