.TH v.net.bridge 1grass "" "GRASS 6.4.2" "Grass User's Manual"
.SH NAME
\fI\fBv.net.bridge\fR\fR  - Computes bridges and articulation points in the network.
.SH KEYWORDS
vector, network, articulation points
.SH SYNOPSIS
\fBv.net.bridge\fR
.br
\fBv.net.bridge help\fR
.br
\fBv.net.bridge input\fR=\fIname\fR \fBoutput\fR=\fIname\fR  [\fBlayer\fR=\fIinteger\fR]  \fBmethod\fR=\fIstring\fR  [--\fBoverwrite\fR]  [--\fBverbose\fR]  [--\fBquiet\fR] 
.SS Flags:
.IP "\fB--overwrite\fR" 4m
.br
Allow output files to overwrite existing files
.IP "\fB--verbose\fR" 4m
.br
Verbose module output
.IP "\fB--quiet\fR" 4m
.br
Quiet module output
.PP
.SS Parameters:
.IP "\fBinput\fR=\fIname\fR" 4m
.br
Name of input vector map
.IP "\fBoutput\fR=\fIname\fR" 4m
.br
Name for output vector map
.IP "\fBlayer\fR=\fIinteger\fR" 4m
.br
Layer number
.br
A single vector map can be connected to multiple database tables. This number determines which table to use.
.br
Default: \fI1\fR
.IP "\fBmethod\fR=\fIstring\fR" 4m
.br
Feature type
.br
Options: \fIbridge,articulation\fR
.br
\fBbridge\fR: Finds bridges
.br
\fBarticulation\fR: Finds articulation points
.PP
.SH DESCRIPTION
\fIv.net.bridge\fR finds bridges and articulation points in a network. 
.SH NOTES
Bridge in a network is an edge/line whose removal would disconnect the (sub-)network. A node is an articulation point if its removal would disconnect the (sub-)network. For more information and formal definitions check the wikipedia entries: articulation point.
.br
The output of the module contains the selected features. If \fBmethod=bridge\fR then lines corresponding to bridges are copied from the input map to the output map. On the other hand, if \fBmethod=articulation\fR then point are created on the positions of articulation points.
.br
.br
In GRASS, \fIline\fR is not always a single line segments. It might be, and often is, a sequence of line segments between two intersections. Also, articulation point is a standard graph theoretic terminology which is slightly  misleading in GRASS. An articulation point in graph theory is an articulation \fInode\fR in GRASS terminology. 
.SH EXAMPLES
\fC
.DS
.br
.DE
\fR
.PP
\fC
.DS
.br
.DE
\fR
.SH SEE ALSO
\fI
v.category,
\fR
.SH AUTHORS
Daniel Bundala, Google Summer of Code 2009, Student
.br
Wolf Bergenheim, Mentor
.PP
\fILast changed: $Date: 2011-11-08 10:42:51 +0100 (Tue, 08 Nov 2011) $\fR
.PP
Full index
.PP
© 2003-2011 GRASS Development Team