2 %> Runs example 21.20 with the Jarnik-Prim algorithm
for minimum spanning tree (Algorithm 21.4 of \cite Bier15-book)
8 %> @author Michel Bierlaire
9 %> @date Sun Mar 29 17:47:37 2015
41 printf("(%d,%d)\n",arcs(j,1),arcs(j,2)) function jarnikPrim(in adj, in cost)
Identifies the minimum spanning tree of an undirected network.
function prepareNetwork(in adj)
Identifies the upstream and downstream nodes of each arc.