# Vector network analysis ideas

Development of further algorithms for Vector network analysis:

## Connectivity (graph theory)

Imagine two parts of a city which are separated by a river. A few bridges exist, each with different capacity. A "v.net.connectivity" tool would analyse where weak nodes exist which would separate both parts of the city in case of an infrastructure failure. Think traffic jam, earth quake, flooding etc. In graph theory, it is 2-connectivity (also called "biconnectivity") and 3-connectivity (also called "triconnectivity").

- related Connectivity Wikipedia article

## Flow network

Imagine a vector network and you want to add numbers to it. This could be traffic density, aquifer/sewage flow or whatever. A "v.net.flow" tool would analyse which throughput you get from a start point to an end point in the network. Of particular interest is the Max-flow min-cut problem.

- related Flow network Wikipedia article
- related Max flow Wikipedia article
- related Max-flow min-cut theorem Wikipedia article

## See also

- Directed Graph Library documentation in GRASS
- GSoC Network Analysis: many new modules!