Well actually, the paper is in GIS terms what has been given in my reference in graph theoretical terms.<br>Can somebody tell me how exactly are r.cost and r.terraflow different, in terms of cost of traversal between two pixels?<br>
<br><div class="gmail_quote">On Sun, Apr 12, 2009 at 2:10 AM, Markus Neteler <span dir="ltr"><<a href="mailto:neteler@osgeo.org">neteler@osgeo.org</a>></span> wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
On Sat, Apr 11, 2009 at 10:23 PM, Jyothish Soman<br>
<div class="im"><<a href="mailto:jyothish.soman@gmail.com">jyothish.soman@gmail.com</a>> wrote:<br>
</div>...<br>
<div class="im">> The assumption I am making is that the algorithm for r.cost is closely<br>
> related to dijkstra's algorithm.<br>
<br>
</div>Just a note:<br>
in GRASS-Addons is a new module (r.terracost which uses this approach):<br>
<br>
<a href="http://trac.osgeo.org/grass/browser/grass-addons/raster/r.terracost" target="_blank">http://trac.osgeo.org/grass/browser/grass-addons/raster/r.terracost</a><br>
<a href="http://trac.osgeo.org/grass/browser/grass-addons/raster/r.terracost/description.html" target="_blank">http://trac.osgeo.org/grass/browser/grass-addons/raster/r.terracost/description.html</a><br>
<font color="#888888"><br>
Markus<br>
</font></blockquote></div><br><br clear="all"><br>-- <br>JYOTHISH SOMAN<br>MS-2008-CS<br>Center for Security, Theory And Algorithm Research (CSTAR)<br>International Institute of Information Technology<br>Hyderabad<br>India<br>
Phone:+91-9966222626<br><a href="http://www.iiit.ac.in/">http://www.iiit.ac.in/</a><br>--------------------------------------------------------------<br>The reasonable man adapts himself to the world; the unreasonable one persists in trying to adapt the world to himself. Therefore, all progress depends on the unreasonable man.<br>
George Bernard Shaw<br>--------------------------------------------------------<br><br>