Vector network analysis

From GRASS-Wiki
Revision as of 17:47, 14 January 2009 by Neteler (talk | contribs)
Jump to navigation Jump to search

Vector network analysis

GRASS provides support for vector network analysis using the DGlib Directed Graph Library.

The following algorithms are implemented:

Vector directions are defined by the digitizing direction (a-->--b). Both directions are supported, network modules provide parameters to assign attribute columns to the forward and backward direction.

  • see the vectorintro "vector map processing and network analysis" help page


Shortest path routing

New ideas

Screenshots


v.net.iso - Split net to bands between cost isolines (direction from centre). Costs of centre node are used in calculation.


v.net.alloc - Allocates subnets for nearest centres (direction from centre). Costs of centre node are used in calculation.


d.path - Find shortest path for selected starting and ending node.