Code covered by the BSD License  

Highlights from
Edmonds algorithm

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

Edmonds algorithm


Ashish Choudhary


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 (1)
17 Jan 2014 hanieh



Contact us