Re: SHORTEST PATH FUNCTION

Hello Daniele, 

Actually the doc is misleading - there was a shortest-path function at one 
point, but i removed it before the release because it was rather slow on 
large networks (and forgot to update the doc..).

If you need it, you can add a method to class world_common in 
crworld.ml. You 
would need to use the route_dij_ function from the  Graph module 
(lib/graph.ml). You can take a look at method is_connected from 
world_common to see how to build the graph before computing the shortest 
path.

Let me know if you run into any trouble.

Best Regards, 

Henri Dubois-Ferriere


> Dear Henry and other Nab users, 
> I've seen that in Class type Worldt.lazy_world_t there
> shuld be a function which computes the shortest path
> between two nodes, but I can't find it.....
> 
> can you help me? is it still under development? 
> 
> thanks a lot.
> 
> Daniele Cancelliere. 
> 
> 
> 	
> 
> 	
> 		
> ____________________________________________________________
> Yahoo! Companion - Scarica gratis la toolbar di Ricerca di Yahoo! 
> http://companion.yahoo.it
>