[GRASS-dev] r.terracost uploaded to grass-addons

[Laura Toma]

Hi,

If you need  a faster module for computing shortest paths , I have  
uploaded a module called r.terracost in grass-addons.

It runs Dijkstra algorithm, which is the standard algorithm for SP  
(all costs need to be non-negative).  The user specifies the input  
and output grid, the grid of start points, and the number of  
tiles.    If you give it numtiles=1, it runs the entire computation  
in memory.  If numtiles>1, it switches to an external version, where  
it computes on one tile at a time. This is efficient in the case the  
grid is large and does not fit in memory.  To find the suggested  
number of tiles, runt it with flag -i.

hope this is useful
-Laura