Vector network analysis - Revision history

Neteler: +v.net.visibility

2019-02-28T12:21:43Z

+v.net.visibility

← Older revision		Revision as of 12:21, 28 February 2019
Line 1:		Line 1:
	GRASS provides support for vector network analysis using the [http://trac.osgeo.org/grass/browser/grass/trunk/lib/vector/dglib/ DGlib] Directed Graph Library.		GRASS GIS provides support for vector network analysis using the [http://trac.osgeo.org/grass/browser/grass/trunk/lib/vector/dglib/ DGlib] Directed Graph Library.

	GRASS 7 has [[WxGUI Vector Network Analysis Tool]] front-end, which supports some of the vector network analysis modules.		GRASS GIS 7 has [[WxGUI Vector Network Analysis Tool]] front-end, which supports some of the vector network analysis modules.
	__TOC__		__TOC__
	== Implemented algorithms ==		== Implemented algorithms ==

	The following algorithms ~~are~~ implemented ~~(GRASS 6.5+)~~:		The following algorithms have been implemented:

	* Vector maintenance: {{cmd\|v.net}}		* Vector maintenance: {{cmd\|v.net}}
Line 22:		Line 22:
	* Finds shortest path using timetables: {{cmd\|v.net.timetable}}		* Finds shortest path using timetables: {{cmd\|v.net.timetable}}
	* Traveling salesman (round trip): {{cmd\|v.net.salesman}}		* Traveling salesman (round trip): {{cmd\|v.net.salesman}}
			* Performs visibility graph construction: {{cmd\|v.net.visibility}}

	Vector directions are defined by the digitizing direction (a-->--b). You can navigate either omnidirectionally or differently in each directions as both directions are supported. Network modules provide parameters to assign attribute columns to the forward and backward direction. To see how a vector is directed, use the "display" parameter of {{cmd\|d.vect}} (set display=dir).		Vector directions (directed graph) are defined by the digitizing direction (a-->--b). You can navigate either omnidirectionally or differently in each directions as both directions are supported. Network modules provide parameters to assign attribute columns to the forward and backward direction. To see how a vector is directed, use the "display" parameter of {{cmd\|d.vect}} (set display=dir).
	Use [[Turntable]] to assign costs to turns on the network.		Use [[Turntable]] to assign costs to turns on the network.

Neteler: remove hardcoded version=70

2018-11-30T23:42:12Z

remove hardcoded version=70

Neteler: /* External links */

2018-11-30T23:40:22Z

External links

← Older revision		Revision as of 23:40, 30 November 2018
Line 96:		Line 96:

	[[Category:Documentation]]		[[Category:Documentation]]
			[[Category:FAQ]]
	[[Category:Vector]]		[[Category:Vector]]
	[[Category:Network Analysis]]		[[Category:Network Analysis]]

Neteler: /* GRASS GIS 7 screenshots */

2016-04-23T22:10:13Z

GRASS GIS 7 screenshots

← Older revision		Revision as of 22:10, 23 April 2016
Line 67:		Line 67:

	See also		See also
			* [[WxGUI Vector Network Analysis Tool]]
	* more screenshots [https://grass.osgeo.org/screenshots/vector/ from the GRASS website]		* more screenshots [https://grass.osgeo.org/screenshots/vector/ from the GRASS website]

Neteler: +GRASS GIS 7 screenshots

2015-10-18T15:29:01Z

+GRASS GIS 7 screenshots

← Older revision		Revision as of 15:29, 18 October 2015
Line 57:		Line 57:

	== Screenshots ==		== Screenshots ==
	* more screenshots [http://grass.osgeo.org/screenshots/vector.php from the GRASS website]

	[[Image:wxgui-vnet-alloc.png\|center\|600px\|thumb\|Subsets for nearest centers (v.net.alloc)]]		=== GRASS GIS 7 screenshots ===

			[[Image:Grass7_vector_network_tool_salesman.png\|center\|600px\|thumb\|Travelling salesman ({{cmd\|v.net.salesman}})]]

			[[Image:Grass7_vector_network_tool_alloc.png\|center\|600px\|thumb\|Subsets for nearest centers ({{cmd\|v.net.alloc}})]]

			[[Image:wxgui-vnet-alloc.png\|center\|600px\|thumb\|Subsets for nearest centers ({{cmd\|v.net.alloc}})]]

			See also
			* more screenshots [https://grass.osgeo.org/screenshots/vector/ from the GRASS website]

	=== Old GRASS 5 screenshots ===		=== Old GRASS 5 screenshots ===

⚠️Turek: turntable

2014-11-28T10:19:51Z

turntable

← Older revision		Revision as of 10:19, 28 November 2014
Line 23:		Line 23:
	* Traveling salesman (round trip): {{cmd\|v.net.salesman\|version=70}}		* Traveling salesman (round trip): {{cmd\|v.net.salesman\|version=70}}

	Vector directions are defined by the digitizing direction (a-->--b). You can navigate either omnidirectionally or differently in each directions as both directions are supported. Network modules provide parameters to assign attribute columns to the forward and backward direction. To see how a vector is directed, use the "display" parameter of {{cmd\|d.vect}} (set display=dir).		Vector directions are defined by the digitizing direction (a-->--b). You can navigate either omnidirectionally or differently in each directions as both directions are supported. Network modules provide parameters to assign attribute columns to the forward and backward direction. To see how a vector is directed, use the "display" parameter of {{cmd\|d.vect}} (set display=dir).
			Use [[Turntable]] to assign costs to turns on the network.

	* see the {{cmd\|vectorintro\|desc=vector map processing and network analysis}} help page		* see the {{cmd\|vectorintro\|desc=vector map processing and network analysis}} help page
Line 50:		Line 51:

	If you are not familiar with layers concept in GRASS see [[Vector Database Management]].		If you are not familiar with layers concept in GRASS see [[Vector Database Management]].

	~~== Extensios ==~~

	~~The [[Turntable]] module (to be added to GRASS soon)~~

	== New ideas ==		== New ideas ==
Line 78:		Line 75:
	== See also ==		== See also ==

			* [[Turntable]]
	* [[GSoC Network Analysis]]: many new modules!		* [[GSoC Network Analysis]]: many new modules!

Neteler: /* External links */

2013-09-30T21:33:29Z

External links

← Older revision		Revision as of 21:33, 30 September 2013
Line 90:		Line 90:
	[[Category:Documentation]]		[[Category:Documentation]]
	[[Category:Vector]]		[[Category:Vector]]
			[[Category:Network Analysis]]

⚠️Landa: whitespace

2013-09-10T10:16:59Z

whitespace

← Older revision		Revision as of 10:16, 10 September 2013
Line 3:		Line 3:
	GRASS 7 has [[WxGUI Vector Network Analysis Tool]] front-end, which supports some of the vector network analysis modules.		GRASS 7 has [[WxGUI Vector Network Analysis Tool]] front-end, which supports some of the vector network analysis modules.
	__TOC__		__TOC__

	== Implemented algorithms ==		== Implemented algorithms ==

Line 84:		Line 83:

	* [http://www.ing.unitn.it/~grass/docs/tutorial_64_en/htdocs/esercitazione/network_analysis/index.html Network analysis tutorial] by University of Trento, Italy		* [http://www.ing.unitn.it/~grass/docs/tutorial_64_en/htdocs/esercitazione/network_analysis/index.html Network analysis tutorial] by University of Trento, Italy


	== External links ==		== External links ==

⚠️Landa: /* Screenshots */

2013-09-10T10:16:24Z

Screenshots

← Older revision		Revision as of 10:16, 10 September 2013
Line 62:		Line 62:
	== Screenshots ==		== Screenshots ==
	* more screenshots [http://grass.osgeo.org/screenshots/vector.php from the GRASS website]		* more screenshots [http://grass.osgeo.org/screenshots/vector.php from the GRASS website]

			[[Image:wxgui-vnet-alloc.png\|center\|600px\|thumb\|Subsets for nearest centers (v.net.alloc)]]

	=== Old GRASS 5 screenshots ===		=== Old GRASS 5 screenshots ===

⚠️Landa: typo

2013-09-10T10:15:29Z

typo

← Older revision		Revision as of 10:15, 10 September 2013
Line 71:		Line 71:
	\|-		\|-
	\|[[Image:D.path.jpg\|center\|400px\|thumb\|{{cmd\|d.path}} - Find shortest path for selected starting and ending node.]]		\|[[Image:D.path.jpg\|center\|400px\|thumb\|{{cmd\|d.path}} - Find shortest path for selected starting and ending node.]]
	\|&~~nbps~~;		\|
	\|}		\|}
	</center>		</center>

← Older revision		Revision as of 23:42, 30 November 2018
Line 7:		Line 7:
	The following algorithms are implemented (GRASS 6.5+):		The following algorithms are implemented (GRASS 6.5+):

	* Vector maintenance: {{cmd\|v.net~~\|version=70~~}}		* Vector maintenance: {{cmd\|v.net}}
	* Shortest path: ~~{{cmd\|d.path\|version=64}} and~~ {{cmd\|v.net.path~~\|version=70~~}}		* Shortest path: {{cmd\|v.net.path}}
	* Shortest path between all pairs of nodes {{cmd\|v.net.allpairs~~\|version=70~~}}		* Shortest path between all pairs of nodes {{cmd\|v.net.allpairs}}
	* Allocation of sources (create subnetworks, e.g. police station zones): {{cmd\|v.net.alloc~~\|version=70~~}}		* Allocation of sources (create subnetworks, e.g. police station zones): {{cmd\|v.net.alloc}}
	* Iso-distances (from centers): {{cmd\|v.net.iso~~\|version=70~~}}		* Iso-distances (from centers): {{cmd\|v.net.iso}}
	* Computes bridges and articulation points: {{cmd\|v.net.bridge~~\|version=70~~}}		* Computes bridges and articulation points: {{cmd\|v.net.bridge}}
	* Computes degree, centrality, betweeness, closeness and eigenvector centrality measures: {{cmd\|v.net.centrality~~\|version=70~~}}		* Computes degree, centrality, betweeness, closeness and eigenvector centrality measures: {{cmd\|v.net.centrality}}
	* Computes strongly and weakly connected components: {{cmd\|v.net.components~~\|version=70~~}}		* Computes strongly and weakly connected components: {{cmd\|v.net.components}}
	* Computes vertex connectivity between two sets of nodes: {{cmd\|v.net.connectivity~~\|version=70~~}}		* Computes vertex connectivity between two sets of nodes: {{cmd\|v.net.connectivity}}
	* Computes shortest distance via the network between the given sets of features: {{cmd\|v.net.distance~~\|version=70~~}}		* Computes shortest distance via the network between the given sets of features: {{cmd\|v.net.distance}}
	* Computes the maximum flow between two sets of nodes: {{cmd\|v.net.flow~~\|version=70~~}}		* Computes the maximum flow between two sets of nodes: {{cmd\|v.net.flow}}
	* Computes minimum spanning tree: {{cmd\|v.net.spanningtree~~\|version=70~~}}		* Computes minimum spanning tree: {{cmd\|v.net.spanningtree}}
	* Minimum Steiner trees (star-like connections, e.g. broadband cable connections): {{cmd\|v.net.steiner~~\|version=70~~}}		* Minimum Steiner trees (star-like connections, e.g. broadband cable connections): {{cmd\|v.net.steiner}}
	* Finds shortest path using timetables: {{cmd\|v.net.timetable~~\|version=70~~}}		* Finds shortest path using timetables: {{cmd\|v.net.timetable}}
	* Traveling salesman (round trip): {{cmd\|v.net.salesman~~\|version=70~~}}		* Traveling salesman (round trip): {{cmd\|v.net.salesman}}

	Vector directions are defined by the digitizing direction (a-->--b). You can navigate either omnidirectionally or differently in each directions as both directions are supported. Network modules provide parameters to assign attribute columns to the forward and backward direction. To see how a vector is directed, use the "display" parameter of {{cmd\|d.vect}} (set display=dir).		Vector directions are defined by the digitizing direction (a-->--b). You can navigate either omnidirectionally or differently in each directions as both directions are supported. Network modules provide parameters to assign attribute columns to the forward and backward direction. To see how a vector is directed, use the "display" parameter of {{cmd\|d.vect}} (set display=dir).