Code covered by the BSD License  

Highlights from
Edmonds algorithm

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

incidence_to_3n.m
function[G]=incidence_to_3n(A);
% changes incidence matrix into 3 column format
N=size(A,1);
count=1;
for i=1:N
    for j=1:N
        if A(i,j)>0
        G(count,:)=[i,j,A(i,j)];
        count=count+1;
        end
        
    end
end




Contact us at files@mathworks.com