This algorithm is based on two papers:
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.
Doesn't work when there are isolated nodes in the graph.
its okie.... i know its my problem and i have to deal with it myself... :S
GOD BLESS U
I would like to help, but I don't have time, sorry.
Thanks for the help
I guess that's the task of your project, no?
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.
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.
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!
Make it more simple
The description for this algorithm is not so clear that I revise it again
Some files are missing, thanks ..