View source for Vector network analysis ideas

{{MoveToTrac}}

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 [http://en.wikipedia.org/wiki/Connectivity_%28graph_theory%29 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 [http://en.wikipedia.org/wiki/Flow_network Flow network Wikipedia article]
* related [http://en.wikipedia.org/wiki/Max_flow Max flow Wikipedia article]
* related [http://en.wikipedia.org/wiki/Max-flow_min-cut_theorem Max-flow min-cut theorem Wikipedia article]

== See also ==

* [http://grass.osgeo.org/dglib/ Directed Graph Library documentation] in GRASS
* [[GSoC Network Analysis]]: many new modules!

[[Category:Development]]
[[Category:Vector]]
[[Category:Network Analysis]]