Vector network analysis ideas - Revision history

⚠️Wenzeslaus: Move To Trac

2014-01-29T02:28:07Z

Move To Trac

← Older revision		Revision as of 02:28, 29 January 2014
Line 1:		Line 1:
			{{MoveToTrac}}

	Development of further algorithms for Vector network analysis:		Development of further algorithms for Vector network analysis:

Neteler: +Category:Network Analysis

2013-09-30T21:34:18Z

+Category:Network Analysis

← Older revision		Revision as of 21:34, 30 September 2013
Line 22:		Line 22:
	[[Category:Development]]		[[Category:Development]]
	[[Category:Vector]]		[[Category:Vector]]
			[[Category:Network Analysis]]

Neteler at 00:36, 7 December 2011

2011-12-07T00:36:11Z

← Older revision		Revision as of 00:36, 7 December 2011
Line 21:		Line 21:

	[[Category:Development]]		[[Category:Development]]
			[[Category:Vector]]

Neteler: /* See also */

2009-07-04T17:09:41Z

Neteler: DGLib ref

2007-09-19T12:06:07Z

DGLib ref

← Older revision		Revision as of 12:06, 19 September 2007
Line 14:		Line 14:
	* related [http://en.wikipedia.org/wiki/Max_flow Max flow 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]		* related [http://en.wikipedia.org/wiki/Max-flow_min-cut_theorem Max-flow min-cut theorem Wikipedia article]

			== See also ==

			* [http://mpa.itc.it/markus/grass63progman/dglib.html Directed Graph Library documentation] in GRASS

	[[Category:Development]]		[[Category:Development]]

Neteler: new ideas (based on comments by Tim Schürmann)

2007-09-14T08:38:36Z

new ideas (based on comments by Tim Schürmann)

New page

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]

[[Category:Development]]

← Older revision		Revision as of 17:09, 4 July 2009
Line 17:		Line 17:
	== See also ==		== See also ==

	* [http://~~mpa~~.~~itc~~.it/~~markus~~/~~grass63progman/dglib.html~~ Directed Graph Library documentation] in GRASS		* [http://grass.osgeo.org/dglib/ Directed Graph Library documentation] in GRASS
			* [[GSoC Network Analysis]]: many new modules!

	[[Category:Development]]		[[Category:Development]]