Edmonds algorithm: showgraph.m - File Exchange

Code covered by the BSD License

Highlights from
Edmonds algorithm

edmonds.m input is a directed graph,
incidence_to_3n.m changes incidence matrix into 3 column format
reconstruct_2.m to reconstruct ED
relabelgraph.m returns the new graphical structure
showgraph.m takes input as structure from edmonds
example.m
example2.m
View all files

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

showgraph.m

function[]=showgraph(G)
% takes input as structure from edmonds
if size(G,2)==3 
    N=max(unique(G(:,1:2)));
    G=[G;N N 0];
INCIDENCE=sparse(G(:,1),G(:,2),G(:,3));
elseif size(G,1)==size(G,2)
    INCIDENCE=sparse(G); 
end

bg=biograph(INCIDENCE);bg.showWeights='On'; 
bg.view;

Highlights from Edmonds algorithm

Highlights from
Edmonds algorithm