[GRASSLIST:2866] Re: shortest path

[Radim Blazek]

On Sunday 07 March 2004 10:58, you wrote:
> Hello dear all,
> At first I want to say : "Thank you so much" with your
> help now I can do many things :)
>
> At this time I want to know more about network
> analysis in GRASS. Specifically about the algorithm
> that GRASS uses to find shortest path between points
> in 'v.net.path' module. I want to know if we don't
> determine the 'afcol', 'abcol' and 'ncol' costs, then
> what is measured for finding path? 

Length of network segments and 0 for nodes.

Radim

> and when we specify
> these values how they influence in algorithm?

These values are taken as costs of whole segments, i.e.
the length of segments is not used. For example, if you have for each
line in the network attribute 'max_speed' and 'length', you can get 
more precise results, if you are looking for fastest path, using 
afcol=length/max_speed (pg driver)

Radim

> Is there any document that can help me in this way?
>
> Any suggestion will be so appreciated.
>
> Regards
>
> Maliheh
>
> __________________________________
> Do you Yahoo!?
> Yahoo! Search - Find what you’re looking for faster
> http://search.yahoo.com