Difference between revisions of "Vector network analysis"
m (→See also)
|Line 56:||Line 56:|
Revision as of 17:35, 6 December 2011
Vector network analysis
GRASS provides support for vector network analysis using the DGlib Directed Graph Library.
The following algorithms are implemented (GRASS 6.5+):
- Vector maintenance:
- Shortest path: and
- Shortest path between all pairs of nodes
- Allocation of sources (create subnetworks, e.g. police station zones):
- Iso-distances (from centers):
- Computes bridges and articulation points:
- Computes degree, centrality, betweeness, closeness and eigenvector centrality measures:
- Computes strongly and weakly connected components:
- Computes vertex connectivity between two sets of nodes:
- Computes shortest distance via the network between the given sets of features:
- Computes the maximum flow between two sets of nodes:
- Computes minimum spanning tree:
- Minimum Steiner trees (star-like connections, e.g. broadband cable connections):
- Finds shortest path using timetables:
- Traveling salesman (round trip):
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(set display=dir).
- see the "vector map processing and network analysis" help page
Example: Shortest path routing
- see the and help pages
- Vector network analysis ideas (please help to realize)
- more screenshots from the GRASS website
- GSoC Network Analysis: many new modules!