Vector network analysis/pl

From GRASS-Wiki
< Vector network analysis
Revision as of 03:26, 10 September 2012 by MilenaN (talk | contribs) (polish translation started)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Vector network analysis

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

Implemented algorithms

The following algorithms are implemented (GRASS 6.5+):

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 d.vect (set display=dir).

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

Example: Shortest path routing

Nowe pomysły

Zrzuty ekranu - Split net to bands between cost isolines (direction from centre). Costs of centre node are used in calculation. - 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.

See also

Linki zewnętrzne