1v.net.spanningtree(1) GRASS GIS User's Manual v.net.spanningtree(1)
2
3
4
6 v.net.spanningtree - Computes minimum spanning tree for the network.
7
9 vector, network, spanning tree
10
12 v.net.spanningtree
13 v.net.spanningtree --help
14 v.net.spanningtree [-g] input=name output=name [arc_layer=string]
15 [node_layer=string] [arc_column=name] [node_column=name] [--over‐
16 write] [--help] [--verbose] [--quiet] [--ui]
17
18 Flags:
19 -g
20 Use geodesic calculation for longitude-latitude locations
21
22 --overwrite
23 Allow output files to overwrite existing files
24
25 --help
26 Print usage summary
27
28 --verbose
29 Verbose module output
30
31 --quiet
32 Quiet module output
33
34 --ui
35 Force launching GUI dialog
36
37 Parameters:
38 input=name [required]
39 Name of input vector map
40 Or data source for direct OGR access
41
42 output=name [required]
43 Name for output vector map
44
45 arc_layer=string
46 Arc layer
47 Vector features can have category values in different layers. This
48 number determines which layer to use. When used with direct OGR ac‐
49 cess this is the layer name.
50 Default: 1
51
52 node_layer=string
53 Node layer
54 Vector features can have category values in different layers. This
55 number determines which layer to use. When used with direct OGR ac‐
56 cess this is the layer name.
57 Default: 2
58
59 arc_column=name
60 Arc forward/both direction(s) cost column (number)
61
62 node_column=name
63 Node cost column (number)
64
66 v.net.spanningtree finds the minimum spanning tree in a network.
67
69 A spanning tree is a minimum cost subnetwork connecting all nodes in an
70 undirected network (same forward and backward costs). If a network is
71 disconnected then the module computes the minimum spanning tree for
72 each (weakly) connected component. So, strictly speaking, v.net.span‐
73 ningtree does not compute spanning tree but a spanning forest. As the
74 name suggests, a spanning tree is a tree. That is, it contains no cy‐
75 cles and if a component has N nodes then the tree has N-1 edges con‐
76 necting all nodes. Accol is used to specify the costs of the edges. The
77 output consists of the edges in the spanning tree.
78
80 Find cheapest set of pipelines connecting all nodes.
81 v.net.spanningtree input=projected_pipelines output=spanningtree accol=cost
82
84 v.net, v.net.steiner
85
87 Daniel Bundala, Google Summer of Code 2009, Student
88 Wolf Bergenheim, Mentor
89
91 Available at: v.net.spanningtree source code (history)
92
93 Accessed: Saturday Jan 21 20:40:02 2023
94
95 Main index | Vector index | Topics index | Keywords index | Graphical
96 index | Full index
97
98 © 2003-2023 GRASS Development Team, GRASS GIS 8.2.1 Reference Manual
99
100
101
102GRASS 8.2.1 v.net.spanningtree(1)