## NAME

v.net.connectivity

## DESCRIPTION

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 ncolumn 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" ncolumn=capacity

## SEE ALSO

v.net.flow, v.net.bridge

## AUTHORS

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

Last changed: $Date: 2011-11-08 11:06:56 +0100 (Tue, 08 Nov 2011) $

Main index - vector index - Full index

© 2003-2011 GRASS Development Team