Hi,<br><br>Waking up a sleeping thread after a long time! ;-)<br><br>Well, I have corrected the problem with float values in distance matrix and negative costs. So, the APSP algorithm seems to be working fine now. <br><br>
Updated the gsoc-tdsp branch with the code[1].<br><br>I also wrote a tutorial to get started and try out the APSP algorithm using pgRouting[2].<br><br>Any inputs are welcome!<br><br>[1] <a href="https://github.com/pgRouting/pgrouting/tree/gsoc-tdsp">https://github.com/pgRouting/pgrouting/tree/gsoc-tdsp</a><br>
[2] <a href="https://github.com/pgRouting/pgrouting/wiki/APSP">https://github.com/pgRouting/pgrouting/wiki/APSP</a><br><br><div class="gmail_quote">On Sat, Jan 29, 2011 at 12:31 PM, Anton Patrushev <span dir="ltr"><<a href="mailto:anton.patrushev@georepublic.de">anton.patrushev@georepublic.de</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">Hi Jay,<br>
<br>
Splendid! Great work!<br>
<br>
What about negative costs - I think there shouldn't be any negative<br>
costs in distance matrix. According to our convention, edges with<br>
negative costs are not included in a graph for shortest path<br>
calculation in Dijkstra, A* and Shooting*.<br>
<div><div></div><div class="h5"><br>
Anton.<br>
_______________________________________________<br>
pgrouting-dev mailing list<br>
<a href="mailto:pgrouting-dev@lists.osgeo.org">pgrouting-dev@lists.osgeo.org</a><br>
<a href="http://lists.osgeo.org/mailman/listinfo/pgrouting-dev" target="_blank">http://lists.osgeo.org/mailman/listinfo/pgrouting-dev</a><br>
</div></div></blockquote></div><br><br clear="all"><br>-- <br>Regards,<br>-Jay Mahadeokar<br><br>