Unsubscribe
--- grassuser-bounces@grass.itc.it <ec.jkd@tpcsed.com>
wrote:
i was trying for shortest path first
could anyone tell me how doese it calculates and wht
o/p it gives in experimental form
thank you>
riad mazloum wrote:
> > I was just wondering what algorithm d.path uses
to find the shortest
> > path, Dijkstra's? or maybe another one
>
> Apparently it does use Dijkstra's method.
>
> lib/vector/Vlib/net.c calls
lib/vector/dglib/graph.c dglShortestPath(),
> which calls dgl_dijkstra_V1() or dgl_dijkstra_V2()
from
> lib/vector/dglib/graph_v1.c or
lib/vector/dglib/graph_v2.c
>
> but I'm not sure which version is used. (1 or 2)
> [I couldn't track where dglGraph_s
*pGraph->Version was populated or if
> DGL_V2 macro was defined]
>
>
> Hamish
>
> _______________________________________________
> grassuser mailing list
> grassuser@grass.itc.it
> http://grass.itc.it/mailman/listinfo/grassuser
>
------------
_______________________________________________
grassuser mailing list
grassuser@grass.itc.it
http://grass.itc.it/mailman/listinfo/grassuser
Unlimited freedom, unlimited storage. Get it now, on http://help.yahoo.com/l/in/yahoo/mail/yahoomail/tools/tools-08.html/