ÐÐÐСÐÐÐÐ

   d.path enables shortest path vector networking - based on DGLib
   (Directed Graph Library) vector network library (see [1]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.

ÐÐ ÐÐÐЧÐÐÐÐ

   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, or if the coor option is used they can be specified
   non-interactively. The actions bound to the mouse buttons are described
   in the terminal window when running the command.

   To calculate shortest path non-interactively and save the path to a new
   vector map, use the v.net.path module.

ÐÐ ÐÐÐÐ

# Spearfish

d.vect roads
d.path -b roads coor="601653.5,4922869.2","593330.8,4924096.6"

СÐ. ТÐÐÐÐ

   [2]v.net.path, [3]DGLib

ÐÐТÐÐ

   Radim Blazek, ITC-Irst, Trento, Italy

   Last changed: $Date: 2007-05-03 05:31:16 -0500 (ЧÑ, 03 май 2007) $

ÐвÑÐ¾Ñ Ð¿ÐµÑевода

References

   1. http://grass.gdf-hannover.de/wiki/Vector_network_analysis
   2. file://localhost/root/tmp/2/fin/v.net.path.html
   3. http://grass.itc.it/dglib/