NAME
d.path - Find shortest path for selected starting and ending node
SYNOPSIS
d.path
d.path help
d.path [-g] map=string [type=string[,string,...]] [afield=integer] [nfield=integer] [afcol=string] [abcol=string] [ncol=string] [color=string] [hcolor=string] [bgcolor=string]
Flags:
- -g
- Use geodesic calculation for longitude-latitude locations
Parameters:
- map=string
- Name of input vector
- type=string
- Arc type
- Options: line,boundary
- Default: line,boundary
- afield=integer
- Arc field
- Default: 1
- nfield=integer
- Node field
- Default: 2
- afcol=string
- Arc forward/both direction(s) cost column
- abcol=string
- Arc backward direction cost column
- ncol=string
- Node cost column
- color=string
- Original line color
- Default: black
- hcolor=string
- Highlight color
- Default: red
- bgcolor=string
- Background color
- Default: white
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: $Date: 2004/08/05 12:53:21 $
Help Index