<div class="gmail_extra">Hi Jay,<br>Thanks for your reply and suggestion. I have already gone through the source of basic dijkstra, A* and the new variant trsp (turn restricted shortest path) as suggested by Steve. I found that dijkstra and A* has been implemented using the boost library while trsp has its own structure and implementation. It also uses STL for priority queue. I am thinking of implementing like trsp using my own data structure. <br>
I am still playing with these. I need some sample database, I am trying to install osm2pgrouting but struggling. <br>Thanks for your help once again.<br><br>Razequl<br><br><div class="gmail_quote">On Sat, Apr 21, 2012 at 12:34 AM, Jay Mahadeokar <span dir="ltr"><<a href="mailto:jai.mahadeokar@gmail.com" target="_blank">jai.mahadeokar@gmail.com</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 Razequl,<br><br>Welcome to pgRouting. Good implementation of Bi-directional searching algorithm will be a very useful addition to pgRouting. I would suggest you to:<br>
<br>- See the pgRouting source.<br>- Study typical pgRouting algorithm implementation link shortest_path, play around with it, compile and debug etc. You will need to use cmake and other tools for the same.<br>
- Think about design the data structures and modules that will be needed for Bi-directional algorithm implementation and discuss the same in the list. <br><br>Steve and Daniel will surely provide useful insights and guidance for you. :-)<br>
Let us know if you have any queries.<br><br>Regards,<br><br><div class="gmail_quote"><div><div class="h5">On Fri, Apr 20, 2012 at 10:12 PM, Razequl Islam <span dir="ltr"><<a href="mailto:ziboncsedu@gmail.com" target="_blank">ziboncsedu@gmail.com</a>></span> wrote:<br>
</div></div><blockquote class="gmail_quote" style="margin:0pt 0pt 0pt 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div><div class="h5">Hi,<br>I am Razequl Islam, student of Dhaka university, Bangladesh. I am new to the group. I am interested in implementing bi directional searching algorithms in pgrouting, Your feedback and suggestions are welcome.<br>
<br>
Best Regards,<br>Razequl<br><br>
<br></div></div>_______________________________________________<br>
pgrouting-dev mailing list<br>
<a href="mailto:pgrouting-dev@lists.osgeo.org" target="_blank">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>
<br></blockquote></div><span class="HOEnZb"><font color="#888888"><br><br clear="all"><br>-- <br>-Jay Mahadeokar<br>Mtech, II Year,<br>IIT Kanpur,<br>India.<br>
</font></span><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>
<br></blockquote></div><br></div>