Code covered by the BSD License  

Highlights from
Edmonds algorithm

5.0 | 1 rating Rate this file 18 Downloads (last 30 days) File Size: 5.8 KB File ID: #24899 Version: 1.0
image thumbnail

Edmonds algorithm



An implementation of Edmond's algorithm to obtain the maximum spanning weight tree from a graph.

| Watch this File

File Information

This is an implementation of the Edmond's algorithm taken from Alan Gibbons book algorithmic graph theory to obtain
a maximum weight spanning tree or a maximum branching.

 I fixed a few mistakes in the published algorithm and have made this implementation available.

I believe you should be able to obtain the minimum spanning tree too by changing weights and changing them back after the application of the algorithm.

Required Products Bioinformatics Toolbox
MATLAB release MATLAB 7.6 (R2008a)
Tags for This File   Please login to tag files.
Please login to add a comment or rating.
Comments and Ratings (2)
24 Feb 2015 Hayro

Hayro (view profile)

What's the complexity of the algorithm?
Is it the same as with "graphmaxflow(G, SNode, TNode)" for which it says "The algorithm that determines Cut, all minimum cuts, has a time complexity of O(2^N), where N is the number of nodes. If this information is not needed, use the graphmaxflow function without the third output."

Comment only
17 Jan 2014 hanieh

hanieh (view profile)


Contact us