d.path(1)

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  [-gb] map=name  [type=string[,string,...]]   [coor=x1,y1,x2,y2]
15       [alayer=integer]   [nlayer=integer]    [afcol=string]    [abcol=string]
16       [ncol=string]     [color=string]    [hcolor=string]    [bgcolor=string]
17       [--verbose]  [--quiet]
18
19   Flags:
20       -g
21           Use geodesic calculation for longitude-latitude locations
22
23       -b
24           Render bold lines
25
26       --verbose
27           Verbose module output
28
29       --quiet
30           Quiet module output
31
32   Parameters:
33       map=name
34           Name of input vector map
35
36       type=string[,string,...]
37           Type
38           Arc type
39           Options: line,boundary
40           Default: line,boundary
41
42       coor=x1,y1,x2,y2
43           Starting and ending coordinates
44
45       alayer=integer
46           Layer number
47           Arc layer
48           Default: 1
49
50       nlayer=integer
51           Layer number
52           Node layer
53           Default: 2
54
55       afcol=string
56           Arc forward/both direction(s) cost column
57
58       abcol=string
59           Arc backward direction cost column
60
61       ncol=string
62           Node cost column
63
64       color=string
65           Original line color
66           Default: black
67
68       hcolor=string
69           Highlight color
70           Default: red
71
72       bgcolor=string
73           Background color
74           Default: white
75

DESCRIPTION

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

NOTE

85       The  user needs to display a vector map before using d.path. The 'from'
86       and 'to' points are entered by mouse into  the  map  displayed  in  the
87       GRASS monitor, or if the coor option is used they can be specified non-
88       interactively.  The actions bound to the mouse buttons are described in
89       the terminal window when running the command.
90
91       To calculate shortest path non-interactively and save the path to a new
92       vector map, use the v.net.path module.
93

EXAMPLE

95
96       # Spearfish
97       d.vect roads
98       d.path -b roads coor="601653.5,4922869.2","593330.8,4924096.6"
99
100

AUTHOR

105       Radim Blazek, ITC-Irst, Trento, Italy
106
107       Last changed: $Date: 2007-05-03 12:31:16 +0200 (Thu, 03 May 2007) $
108
109       Full index
110
111       © 2003-2008 GRASS Development Team
112
113
114
115GRASS 6.3.0                                                          d.path(1)