Edmonds algorithm

Version 1.0.0.0 (5.8 KB) by Ashish Choudhary
An implementation of Edmond's algorithm to obtain the maximum spanning weight tree from a graph.
5.0
(2)
1.7K Downloads
Updated 1 Aug 2009

View License

Folks,
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.

Cite As

Ashish Choudhary (2026). Edmonds algorithm (https://www.mathworks.com/matlabcentral/fileexchange/24899-edmonds-algorithm), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2008a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Graph and Network Algorithms in Help Center and MATLAB Answers
Tags Add Tags

Version Published Release Notes
1.0.0.0