1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
|
<h2>DESCRIPTION</h2>
<em>d.path</em> enables shortest path vector networking - based on DGLib
(Directed Graph Library) vector network library
(see <a href="http://mpa.itc.it/radim/g51/d.path.jpg">screenshot</a>).
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.
<h2>NOTE</h2>
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.
The actions bound to the mouse buttons are described in the terminal
window when running the command.
<P>
To calculate shortest path non-interactively, the module <em>v.net.path</a>
must be used.
<h2>SEE ALSO</h2>
<em><a HREF="v.net.path.html">v.net.path</a></em><br>
<em><a HREF="http://grass.itc.it/dglib/">DGLib</a></em><br>
<em><a HREF="http://grass.itc.it/grass57/tutorial/ex_complex.html#shortestpath">GRASS 5.7 tutorial pages</a></em>
<h2>AUTHOR</h2>
Radim Blazek, ITC-Irst, Trento, Italy
<p><i>Last changed: $Date: 2004/12/03 16:33:52 $</i>
|
