[GRASS5] v.net.path

[Radim Blazek]

On 5/3/06, Robin Chauhan <robin.chauhan at gmail.com> wrote:
> Could anyone tell me if there have been any plans or developments for
> v.net.path lately?
>
> I have read this old thread on v.net.* implementation using dglib vs dgtable:
>
>  http://grass.itc.it/pipermail/grass5/2003-September/008673.html
>
> ...which suggests dglib is abandoned and maybe should be replaced by
> dgtable.  But the URL for dgtable no longer works and Google gives
> nothing on it.
>
> I would also like to know which algo is used for shortest path in
> dgtable... In my understanding dijkstra's as used by dglib is terribly
> inefficient for the shortest path problem, I think A* would be far
> better here.

dglib is not slow, the only problem is to calculate matrices of costs
for more points becaus dglib cache can fail it is disabled in v.net.* modules.

Radim

> -Robin Chauhan
>
> _______________________________________________
> grass5 mailing list
> grass5 at grass.itc.it
> http://grass.itc.it/mailman/listinfo/grass5
>