## NAME

v.net.spanningtree

## DESCRIPTION

v.net.spanningtree find the minimum spanning tree in a network.

## NOTES

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.

## EXAMPLES

Find cheapest set of pipelines connecting all nodes.

    v.net.spanningtree input=projected_pipelines output=spanningtree accol=cost

## SEE ALSO

v.net.steiner

## AUTHORS

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

Last changed: $Date: 2011-11-08 10:42:51 +0100 (Tue, 08 Nov 2011) $

Main index - vector index - Full index

© 2003-2011 GRASS Development Team