Code covered by the BSD License

### Highlights from Maximum Weight Spanning tree (Undirected)

4.33333
4.3 | 3 ratings Rate this file 18 Downloads (last 30 days) File Size: 2.67 KB File ID: #23276 Version: 1.6

# Maximum Weight Spanning tree (Undirected)

### Guangdi Li (view profile)

12 Mar 2009 (Updated )

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

File Information
Description

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.

MATLAB release MATLAB 7.6 (R2008a)
17 Feb 2014 Yaser

### Yaser (view profile)

Doesn't work when there are isolated nodes in the graph.

02 Dec 2011 Sim

### Sim (view profile)

its okie.... i know its my problem and i have to deal with it myself... :S

GOD BLESS U

Comment only
02 Dec 2011 Guangdi Li

### Guangdi Li (view profile)

I would like to help, but I don't have time, sorry.

Comment only
02 Dec 2011 Sim

### Sim (view profile)

Thanks for the help

Comment only
02 Dec 2011 Guangdi Li

Comment only
02 Dec 2011 Sim

### Sim (view profile)

Hello Guangdi Li,

I require a code for enumerating all possible spanning trees of an undirected connected graph. By using the Cayley's formula, i first need to take out the total number of spanning trees of a graph and then i need to create that total number of spanning trees through a code.... I'm completely new to matlab and i need to complete my university project as soon as possible.
Sim

Comment only
08 Jul 2009 sweety

### sweety (view profile)

02 Jun 2009 Guangdi Li

### Guangdi Li (view profile)

Sorry for replying you 3 days later ( busy for master defense ).
I have updated another document named as DirectedMaximumSpanningTree.zip, including the algorithm that you have desired.
If there is any problem, please let me know, i will help you as soon as possible.

Comment only
29 May 2009 enrico

### enrico (view profile)

The Chu-Liu-Edmonds Algorithm is what I was really looking for.
Could you please tell me how to modofy the code to get the minimum Spannin Tree in a DIRECTED graph!?

I would really appreciate!

thanks!

28 Apr 2009 1.1

Some files are missing, thanks ..

02 Jun 2009 1.4

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

11 Jun 2009 1.6

Make it more simple