Maximum Weight Spanning tree (Undirected)

Version 1.6.0.0 (2,67 KB) von Guangdi Li
Chu-Liu-Edmonds Algorithm for learning "Undirected Maximum Weight Spanning tree" is proposed here.
3,4K Downloads
Aktualisiert 11. Jun 2009

Lizenz anzeigen

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.

Zitieren als

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

Kompatibilität der MATLAB-Version
Erstellt mit R2008a
Kompatibel mit allen Versionen
Plattform-Kompatibilität
Windows macOS Linux
Kategorien
Mehr zu Undirected Graphs finden Sie in Help Center und MATLAB Answers

Community Treasure Hunt

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

Start Hunting!
Version Veröffentlicht Versionshinweise
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