DESCRIPTION

d.path enables shortest path vector networking - based on DGLib (Directed Graph Library) vector network library (see screenshot). Costs may be either line lengths, or attributes saved in a database table. Supported are cost assignments for both arcs and nodes, and also different in both directions of a vector line. For areas cost will be calculated along boundary lines.

NOTE

You need to display a vector map before using d.path.

SEE ALSO

DGLib
GRASS 5.1 tutorial pages

AUTHOR

Radim Blazek, ITC-Irst, Trento, Italy

Last changed: $


Help Index