Hi, then for larger dataset i should use dijkstra . then for small data you would recommend a-star?<div>and is there a difference between the routes the algorithms calculated, i mean is it possible dijkstra creates a different shortest path than a* ?</div>
<div><br></div><div>what was your intention implementing two or more algorithms?</div><div><br></div><div><br></div><div><br><div><br><div class="gmail_quote">2009/11/21 Anton Patrushev <span dir="ltr"><<a href="mailto:anton.patrushev@gmail.com">anton.patrushev@gmail.com</a>></span><br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">Hi Mehmet,<br>
<br>
the calculation time for any pgRouting algorithm consists of 2 oars -<br>
data loading and calculation itself.<br>
For Dijkstra loading time is slightly less but calculation time is<br>
longer, for A* it is opposite - the route calculation is faster, but<br>
it needs more data to load.<br>
That's why we actually keep both algorithms - if for your data set<br>
there is no difference between them, then you should probably choose<br>
Dijkstra and don't bother with A*.<br>
<br>
Anton.<br>
_______________________________________________<br>
Pgrouting-users mailing list<br>
<a href="mailto:Pgrouting-users@lists.postlbs.org">Pgrouting-users@lists.postlbs.org</a><br>
<a href="http://lists.postlbs.org/mailman/listinfo/pgrouting-users" target="_blank">http://lists.postlbs.org/mailman/listinfo/pgrouting-users</a><br>
</blockquote></div><br></div></div>