1d.path(1)                     Grass User's Manual                    d.path(1)
2
3
4

NAME

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

KEYWORDS

9       display, networking
10

SYNOPSIS

12       d.path
13       d.path help
14       d.path  [-g]  map=name   [type=string[,string,...]]    [alayer=integer]
15       [nlayer=integer]    [afcol=string]     [abcol=string]     [ncol=string]
16       [color=string]   [hcolor=string]   [bgcolor=string]
17
18   Flags:
19       -g  Use geodesic calculation for longitude-latitude locations
20
21   Parameters:
22       map=name
23           Name of input vector map
24
25       type=string[,string,...]
26           Arc type Options: line,boundary Default: line,boundary
27
28       alayer=integer
29           Arc layer Default: 1
30
31       nlayer=integer
32           Node layer Default: 2
33
34       afcol=string
35           Arc forward/both direction(s) cost column
36
37       abcol=string
38           Arc backward direction cost column
39
40       ncol=string
41           Node cost column
42
43       color=string
44           Original line color Default: black
45
46       hcolor=string
47           Highlight color Default: red
48
49       bgcolor=string
50           Background color Default: white
51

DESCRIPTION

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

NOTE

61       The user needs to display a vector map before using d.path. The  'from'
62       and  'to'  points  are  entered  by mouse into the map displayed in the
63       GRASS monitor.  The actions bound to the mouse buttons are described in
64       the terminal window when running the command.
65
66       To  calculate  shortest  path  non-interactively, the module v.net.path
67       must be used.
68

SEE ALSO

70        v.net.path, DGLib
71

AUTHOR

73       Radim Blazek, ITC-Irst, Trento, Italy
74
75       Last changed: $Date: 2007/02/26 01:58:48 $
76
77       Full index
78
79
80
81GRASS 6.2.2                                                          d.path(1)