v.net.connectivity(1grass) | GRASS GIS User's Manual | v.net.connectivity(1grass) |
v.net.connectivity - Computes vertex connectivity between two sets of nodes in the network.
vector, network, connectivity
v.net.connectivity
v.net.connectivity --help
v.net.connectivity input=name
[arc_layer=string] [node_layer=string]
[arc_column=name] [arc_backward_column=name]
output=name [node_column=name]
[set1_cats=range] [set1_where=sql_query]
[set2_cats=range] [set2_where=sql_query]
[--overwrite] [--help] [--verbose] [--quiet]
[--ui]
v.net.connectivity computes vertex connectivity between two sets, i.e. the minimum number of vertices whose removal would separate two given sets.
Two sets (set1 and set2) are specified by respective layer, where and cats parameters. Similarly to v.net.flow module, capacities of nodes can be given by node_column option. v.net.connectivity finds the set of nodes of minimum total capacitiy separating the two given sets and outputs map containing points on the positions of these nodes. Default capacity, which is used when no column is specified, is one.
The following command finds the minimum number of intersections
separating roads on the left bank from roads on the right bank.
v.net.connectivity input=roads output=roads_conn set1_where="bank=left" \
set2_where="bank=right"
v.net.connectivity input=airtraffic output=connectivity \
set1_where="name=JFK" set2_where="name=Heathrow" node_column=capacity
v.net, v.net.flow, v.net.bridge
Daniel Bundala, Google Summer of Code 2009, Student
Wolf Bergenheim, Mentor
Available at: v.net.connectivity source code (history)
Main index | Vector index | Topics index | Keywords index | Graphical index | Full index
© 2003-2020 GRASS Development Team, GRASS GIS 7.8.5 Reference Manual
GRASS 7.8.5 |