Maximum Weight Spanning tree (Undirected)

Chu-Liu-Edmonds Algorithm for learning "Undirected Maximum Weight Spanning tree" is proposed here.

Version 1.6.0.0 (2.67 KB)
3.4K Downloads
(3)
11 Jun 2009

You are now following this Submission

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.

Cite As

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

Categories

Find more on Undirected Graphs in Help Center and MATLAB Answers

General Information

MATLAB Release Compatibility

  • Compatible with any release

Platform Compatibility

  • Windows
  • macOS
  • Linux
Open in new tab
Version Published Release Notes
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