Maximum Weight Spanning tree (Undirected)
12 Mar 2009
(Updated 11 Jun 2009)
Chu-Liu-Edmonds Algorithm for learning "Undirected Maximum Weight Spanning tree" is proposed here.
% CostMatrix can be considered as the cost matrix
CostMatrix = rand(30);
% Tree is the matrix saving the tree, and Cost is summation of all cost
% upon arcs.
[ Tree,Cost ] = UndirectedMaximumSpanningTree ( CostMatrix )
h1 = view(biograph( Tree ))