3
<em>d.path</em> enables shortest path vector networking.
4
Costs may be either line lengths, or attributes saved in a database table.
5
Supported are cost assignments for both arcs and nodes, and also different
6
in both directions of a vector line. For areas cost will be calculated along
11
The user needs to display a vector map before using d.path. The 'from' and 'to'
12
points are entered by mouse into the map displayed in the GRASS monitor, or
13
if the <b>coor</b> option is used they can be specified non-interactively.
14
The actions bound to the mouse buttons are described in the terminal
15
window when running the command.
17
To calculate shortest path non-interactively and save the path to a new vector
18
map, use the <em>v.net.path</em> module.
22
Interactive shortest path routing on road network (Spearfish region):
23
<div class="code"><pre>
30
Non-interactive shortest path routing on road network (Spearfish region):
31
<div class="code"><pre>
32
d.path -b roads coor=601653.5,4922869.2,593330.8,4924096.6
38
<a href="v.net.path.html">v.net.path</a>
43
Radim Blazek, ITC-Irst, Trento, Italy
46
<i>Last changed: $Date: 2011-11-08 10:42:51 +0100 (Tue, 08 Nov 2011) $</i>