v.net.connectivity(1grass)

v.net.connectivity1grass

Computes vertex connectivity between two sets of nodes in the network.

Usage

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]

Keywords

vector, network, connectivity

Overview

v.net.connectivity computes vertex connectivity between two sets, i.e. the minimum number of vertices whose removal would separate two given sets.

Notes

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.

Examples

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

Source code

Available at: v.net.connectivity source code (history)

Accessed: Monday Feb 24 17:51:18 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.

  1. 7
  2. 8
  3. 9
  4. 10
  5. 11
  6. 12
  7. 13

Authors

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

From grass-doc 8.4.1-1 in Debian 13 (Trixie). Parsed by carta from the page's man source.