v.net.spanningtree1grass
Computes minimum spanning tree for the network.
Usage
v.net.spanningtree
v.net.spanningtree --help
v.net.spanningtree [-g]
input=name
output=name
[arc_layer=string]
[node_layer=string]
[arc_column=name]
[node_column=name]
[--overwrite]
[--help]
[--verbose]
[--quiet]
[--ui]
Keywords
vector, network, spanning tree
Overview
v.net.spanningtree finds the minimum spanning tree in a network.
Notes
A spanning tree is a minimum cost subnetwork connecting all nodes in an undirected network (same forward and backward costs). If a network is disconnected then the module computes the minimum spanning tree for each (weakly) connected component. So, strictly speaking, v.net.spanningtree does not compute spanning tree but a spanning forest. As the name suggests, a spanning tree is a tree. That is, it contains no cycles and if a component has N nodes then the tree has N-1 edges connecting 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=costSource code
Available at: v.net.spanningtree source code (history)
Accessed: Monday Feb 24 17:51:19 2025
Main index | Vector index | Topics index | Keywords index | Graphical index | Full index
© 2003-2025 GRASS Development Team, GRASS GIS 8.4.1 Reference Manual
Releases
7 releases since Debian 7 (Wheezy); the text changed 6 times.