[GRASSLIST:653] Re: Shortest distance routing

[Radim Blazek]

> You need grass51 (from cvs), which has the dglib library and some tools
> that use it, such as d.path.
>
> http://mpa.itc.it/radim/g51/d.path.jpg
>
> I am using this kind of functionality (I can't discuss the big picture
> behind it on the list, but maybe in private), and have been working on
> modifying d.path (renamed to v.path) to be a bit more friendly for my
> purposes (I would like to extract information on the actual segments,
> which d.path does not do, just displays it in the monitor), with a flag
> to display the results on the monitor (to check results).
>
> At present, d.path allows you to click on the monitor to select start
> and end, my v.path takes an unlimited number of coordinate pairs as an
> argument, and will make find the shortest path that goes through the
> points in order (ie not a travelling salesman problem, which would
> re-arrange the order).
>
> I haven't finalised all the interfaces for v.path, so it may be possible
> for me to adjust it to suit what others would like from it.

Look at v.net.path. Which informations about segments do you need, 
categories of lines on shortest path?


Radim