Optimization: principles and algorithms, by Michel Bierlaire

Algorithm 21.4: JarnikPrim. More...
Go to the source code of this file.
Functions  
function  jarnikPrim (in adj, in cost) 
Identifies the minimum spanning tree of an undirected network. More...  
Algorithm 21.4: JarnikPrim.
Implementation of algorithm 21.4 of [1]
Definition in file jarnikPrim.m.
function jarnikPrim  (  in  adj, 
in  cost  
) 
Identifies the minimum spanning tree of an undirected network.
adj  the symmetric adjacency matrix of the undirected network. It is a matrix, such that the element at row i and column j, and the element at row j and column i, contain to the id of the edge (i,j). The numbering should be from 1 to n. 
cost  a vector of size n containing the cost of each edge 