[GRASS5] Re: Shortest path

[Radim Blazek]

> 
> Ok for shortcuts, but what if my window is huge too?
> Tell me if I'm wrong: when we get to calculating the path we need select groups of arcs sharing
> from_node, and link that node with relative to_nodes.
> This means O(#from_node). What if I have to perform 100.000 select?
> I've tried something with Postgres: my city map on paper gives faster result :(
> I suggest topology/geometry into digs, as Radim and you say, and tools for vect to graph > transformation:
> 
> $ v.net option=vect2graph in=vector out=graph f_catn=1001 t_catn=1002 c_catn=1003 u_catn=1004
> 
> f_catn: from node category
> t_catn: to node category
> c_catn: cost category
> u_catn: user category to be output by SP routines (ie. ArcId)
> 
> Roberto
> 

OK.

Radim

---------------------------------------- 
If you want to unsubscribe from GRASS Development Team mailing list write to:
minordomo at geog.uni-hannover.de with
subject 'unsubscribe grass5'