Hi,
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.
Best Regards,
Razequl
Hi Razequl,
Welcome to pgRouting. Good implementation of Bi-directional searching algorithm will be a very useful addition to pgRouting. I would suggest you to:
- See the pgRouting source.
- 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.
- Think about design the data structures and modules that will be needed for Bi-directional algorithm implementation and discuss the same in the list.
Steve and Daniel will surely provide useful insights and guidance for you. 
Let us know if you have any queries.
Regards,
On Fri, Apr 20, 2012 at 10:12 PM, Razequl Islam <ziboncsedu@gmail.com> wrote:
Hi,
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.Best Regards,
Razequl
pgrouting-dev mailing list
pgrouting-dev@lists.osgeo.org
http://lists.osgeo.org/mailman/listinfo/pgrouting-dev
–
-Jay Mahadeokar
Mtech, II Year,
IIT Kanpur,
India.
Hi Jay,
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.
I am still playing with these. I need some sample database, I am trying to
install osm2pgrouting but struggling.
Thanks for your help once again.
Razequl
On Sat, Apr 21, 2012 at 12:34 AM, Jay Mahadeokar
<jai.mahadeokar@gmail.com>wrote:
Hi Razequl,
Welcome to pgRouting. Good implementation of Bi-directional searching
algorithm will be a very useful addition to pgRouting. I would suggest you
to:- See the pgRouting source.
- 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.
- Think about design the data structures and modules that will be needed
for Bi-directional algorithm implementation and discuss the same in the
list.Steve and Daniel will surely provide useful insights and guidance for you.
Let us know if you have any queries.Regards,
On Fri, Apr 20, 2012 at 10:12 PM, Razequl Islam <ziboncsedu@gmail.com>wrote:
Hi,
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.Best Regards,
Razequl_______________________________________________
pgrouting-dev mailing list
pgrouting-dev@lists.osgeo.org
http://lists.osgeo.org/mailman/listinfo/pgrouting-dev--
-Jay Mahadeokar
Mtech, II Year,
IIT Kanpur,
India._______________________________________________
pgrouting-dev mailing list
pgrouting-dev@lists.osgeo.org
http://lists.osgeo.org/mailman/listinfo/pgrouting-dev
Hi Razequl,
I have a few of comments in no particular order:
* We have a GSoC student that has proposed a project to do a Bi-directional routing algorithm and we should know by tomorrow if that was accepted or not. That said, while if it is accepted then having two is a little redundant unless one supports turn restrictions like TRSP and one does not.
* Boost as the advantage that is a generic library that is well tested and most of the development is about how to use the library to do what you want. On the other hand it is more restrictive if you want to do something similar to Boost but not supported in the existing code. You might be able to reuse some of the TRSP code which would be good if you can do that.
* Testing - I think you need to consider making some simple unit test examples that allow you to validate your code. This would be a collection of tests that you can apply to a relatively simple network that is easy to debug and trace the execution. Once this is done and working it is reasonable to throw a larger network like osm2pgrouting to look at performance tuning.
* One of the keys to making quality releases is our ability to automate sanity testing of the code before we release it. While we do not have any automated testing yet, it is very high on my list of things that need to get done, so I will be pushing everyone to support this.
As Jay said, if you have any specific questions that we can help with, please ask on the list.
Best regards,
-Steve
On 4/22/2012 1:00 PM, Razequl Islam wrote:
Hi Jay,
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.
I am still playing with these. I need some sample database, I am trying
to install osm2pgrouting but struggling.
Thanks for your help once again.Razequl
On Sat, Apr 21, 2012 at 12:34 AM, Jay Mahadeokar
<jai.mahadeokar@gmail.com <mailto:jai.mahadeokar@gmail.com>> wrote:Hi Razequl,
Welcome to pgRouting. Good implementation of Bi-directional
searching algorithm will be a very useful addition to pgRouting. I
would suggest you to:- See the pgRouting source.
- 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.
- Think about design the data structures and modules that will be
needed for Bi-directional algorithm implementation and discuss the
same in the list.Steve and Daniel will surely provide useful insights and guidance
for you.
Let us know if you have any queries.Regards,
On Fri, Apr 20, 2012 at 10:12 PM, Razequl Islam
<ziboncsedu@gmail.com <mailto:ziboncsedu@gmail.com>> wrote:Hi,
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.Best Regards,
Razequl_______________________________________________
pgrouting-dev mailing list
pgrouting-dev@lists.osgeo.org <mailto:pgrouting-dev@lists.osgeo.org>
http://lists.osgeo.org/mailman/listinfo/pgrouting-dev--
-Jay Mahadeokar
Mtech, II Year,
IIT Kanpur,
India._______________________________________________
pgrouting-dev mailing list
pgrouting-dev@lists.osgeo.org <mailto:pgrouting-dev@lists.osgeo.org>
http://lists.osgeo.org/mailman/listinfo/pgrouting-dev_______________________________________________
pgrouting-dev mailing list
pgrouting-dev@lists.osgeo.org
http://lists.osgeo.org/mailman/listinfo/pgrouting-dev
Hi Razequl,
I can be slow when I'm distracted by other things - I did not connect Razequl as being the same person as Khondoker that you proposal was submitted under until now when I was reviewing your proposal again. So please ignore my first bullet below and accept my apology.
I have developed some test cases for the TRSP algorithm and we might be able to use them as tests for the bidirectional algorithm. I also have extensive datasets covering large areas that we can potentially use for performance testing.
Thank you for your introduction.
Best regards,
-Steve
On 4/22/2012 2:01 PM, Stephen Woodbridge wrote:
Hi Razequl,
I have a few of comments in no particular order:
* We have a GSoC student that has proposed a project to do a
Bi-directional routing algorithm and we should know by tomorrow if that
was accepted or not. That said, while if it is accepted then having two
is a little redundant unless one supports turn restrictions like TRSP
and one does not.* Boost as the advantage that is a generic library that is well tested
and most of the development is about how to use the library to do what
you want. On the other hand it is more restrictive if you want to do
something similar to Boost but not supported in the existing code. You
might be able to reuse some of the TRSP code which would be good if you
can do that.* Testing - I think you need to consider making some simple unit test
examples that allow you to validate your code. This would be a
collection of tests that you can apply to a relatively simple network
that is easy to debug and trace the execution. Once this is done and
working it is reasonable to throw a larger network like osm2pgrouting to
look at performance tuning.* One of the keys to making quality releases is our ability to automate
sanity testing of the code before we release it. While we do not have
any automated testing yet, it is very high on my list of things that
need to get done, so I will be pushing everyone to support this.As Jay said, if you have any specific questions that we can help with,
please ask on the list.Best regards,
-SteveOn 4/22/2012 1:00 PM, Razequl Islam wrote:
Hi Jay,
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.
I am still playing with these. I need some sample database, I am trying
to install osm2pgrouting but struggling.
Thanks for your help once again.Razequl
On Sat, Apr 21, 2012 at 12:34 AM, Jay Mahadeokar
<jai.mahadeokar@gmail.com <mailto:jai.mahadeokar@gmail.com>> wrote:Hi Razequl,
Welcome to pgRouting. Good implementation of Bi-directional
searching algorithm will be a very useful addition to pgRouting. I
would suggest you to:- See the pgRouting source.
- 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.
- Think about design the data structures and modules that will be
needed for Bi-directional algorithm implementation and discuss the
same in the list.Steve and Daniel will surely provide useful insights and guidance
for you.
Let us know if you have any queries.Regards,
On Fri, Apr 20, 2012 at 10:12 PM, Razequl Islam
<ziboncsedu@gmail.com <mailto:ziboncsedu@gmail.com>> wrote:Hi,
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.Best Regards,
Razequl_______________________________________________
pgrouting-dev mailing list
pgrouting-dev@lists.osgeo.org <mailto:pgrouting-dev@lists.osgeo.org>
http://lists.osgeo.org/mailman/listinfo/pgrouting-dev--
-Jay Mahadeokar
Mtech, II Year,
IIT Kanpur,
India._______________________________________________
pgrouting-dev mailing list
pgrouting-dev@lists.osgeo.org <mailto:pgrouting-dev@lists.osgeo.org>
http://lists.osgeo.org/mailman/listinfo/pgrouting-dev_______________________________________________
pgrouting-dev mailing list
pgrouting-dev@lists.osgeo.org
http://lists.osgeo.org/mailman/listinfo/pgrouting-dev_______________________________________________
pgrouting-dev mailing list
pgrouting-dev@lists.osgeo.org
http://lists.osgeo.org/mailman/listinfo/pgrouting-dev
Hi Steve,
It happens
Thanks for the clarification. Actually I was a bit confused also. You may
call me Razequl or my nick name Zibon.
I think your test cases will be very helpful for testing the new
implementation.
Razequl
On Mon, Apr 23, 2012 at 10:16 AM, Stephen Woodbridge <
woodbri@swoodbridge.com> wrote:
Hi Razequl,
I can be slow when I'm distracted by other things - I did not connect
Razequl as being the same person as Khondoker that you proposal was
submitted under until now when I was reviewing your proposal again. So
please ignore my first bullet below and accept my apology.I have developed some test cases for the TRSP algorithm and we might be
able to use them as tests for the bidirectional algorithm. I also have
extensive datasets covering large areas that we can potentially use for
performance testing.Thank you for your introduction.
Best regards,
-SteveOn 4/22/2012 2:01 PM, Stephen Woodbridge wrote:
Hi Razequl,
I have a few of comments in no particular order:
* We have a GSoC student that has proposed a project to do a
Bi-directional routing algorithm and we should know by tomorrow if that
was accepted or not. That said, while if it is accepted then having two
is a little redundant unless one supports turn restrictions like TRSP
and one does not.* Boost as the advantage that is a generic library that is well tested
and most of the development is about how to use the library to do what
you want. On the other hand it is more restrictive if you want to do
something similar to Boost but not supported in the existing code. You
might be able to reuse some of the TRSP code which would be good if you
can do that.* Testing - I think you need to consider making some simple unit test
examples that allow you to validate your code. This would be a
collection of tests that you can apply to a relatively simple network
that is easy to debug and trace the execution. Once this is done and
working it is reasonable to throw a larger network like osm2pgrouting to
look at performance tuning.* One of the keys to making quality releases is our ability to automate
sanity testing of the code before we release it. While we do not have
any automated testing yet, it is very high on my list of things that
need to get done, so I will be pushing everyone to support this.As Jay said, if you have any specific questions that we can help with,
please ask on the list.Best regards,
-SteveOn 4/22/2012 1:00 PM, Razequl Islam wrote:
Hi Jay,
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.
I am still playing with these. I need some sample database, I am trying
to install osm2pgrouting but struggling.
Thanks for your help once again.Razequl
On Sat, Apr 21, 2012 at 12:34 AM, Jay Mahadeokar
<jai.mahadeokar@gmail.com <mailto:jai.mahadeokar@gmail.**com<jai.mahadeokar@gmail.com>>>
wrote:Hi Razequl,
Welcome to pgRouting. Good implementation of Bi-directional
searching algorithm will be a very useful addition to pgRouting. I
would suggest you to:- See the pgRouting source.
- 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.
- Think about design the data structures and modules that will be
needed for Bi-directional algorithm implementation and discuss the
same in the list.Steve and Daniel will surely provide useful insights and guidance
for you.
Let us know if you have any queries.Regards,
On Fri, Apr 20, 2012 at 10:12 PM, Razequl Islam
<ziboncsedu@gmail.com <mailto:ziboncsedu@gmail.com>> wrote:Hi,
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.Best Regards,
Razequl______________________________**_________________
pgrouting-dev mailing list
pgrouting-dev@lists.osgeo.org <mailto:pgrouting-dev@lists.**osgeo.org<pgrouting-dev@lists.osgeo.org>
>
http://lists.osgeo.org/**mailman/listinfo/pgrouting-dev<http://lists.osgeo.org/mailman/listinfo/pgrouting-dev>--
-Jay Mahadeokar
Mtech, II Year,
IIT Kanpur,
India.______________________________**_________________
pgrouting-dev mailing list
pgrouting-dev@lists.osgeo.org <mailto:pgrouting-dev@lists.**osgeo.org<pgrouting-dev@lists.osgeo.org>
>
http://lists.osgeo.org/**mailman/listinfo/pgrouting-dev<http://lists.osgeo.org/mailman/listinfo/pgrouting-dev>______________________________**_________________
pgrouting-dev mailing list
pgrouting-dev@lists.osgeo.org
http://lists.osgeo.org/**mailman/listinfo/pgrouting-dev<http://lists.osgeo.org/mailman/listinfo/pgrouting-dev>______________________________**_________________
pgrouting-dev mailing list
pgrouting-dev@lists.osgeo.org
http://lists.osgeo.org/**mailman/listinfo/pgrouting-dev<http://lists.osgeo.org/mailman/listinfo/pgrouting-dev>______________________________**_________________
pgrouting-dev mailing list
pgrouting-dev@lists.osgeo.org
http://lists.osgeo.org/**mailman/listinfo/pgrouting-dev<http://lists.osgeo.org/mailman/listinfo/pgrouting-dev>