DESCRIPTION find the minimum spanning tree in a network.


Spanning tree is a minimum cost subnetwork connecting all nodes in a network. Or, if a network is disconnected then the module computes the minimum spanning tree for each (weakly) connected component. So, strictly speaking, module does not compute spanning tree but a spanning forest. As the name suggests spanning tree is a tree. That is, it contains no cycles and if a component has N nodes that the tree has N-1 edges and connected all nodes. Accol is used to specify the costs of the edges. The output consists of the edges in the spanning tree.


Find cheapest set of pipelines connecting all nodes. input=projected_pipelines output=spanningtree accol=cost 



Daniel Bundala, Google Summer of Code 2009, Student
Wolf Bergenheim, Mentor

Last changed: $Date$