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
The user needs to display a vector map before using d.path. The 'from' and 'to'
points are entered by mouse into the map displayed in the GRASS monitor, or
if the coor option is used they can be specified non-interactively.
The actions bound to the mouse buttons are described in the terminal
window when running the command.
To calculate shortest path non-interactively and save the path to a new vector
map, use the v.net.path module.
EXAMPLE
# Spearfish
d.vect roads
d.path -b roads coor="601653.5,4922869.2","593330.8,4924096.6"
SEE ALSO
v.net.path,
DGLib
AUTHOR
Radim Blazek, ITC-Irst, Trento, Italy
Last changed: $Date$