pgRouting Wrapper for point to point dijkstra shortest path routing#4
pgRouting Wrapper for point to point dijkstra shortest path routing#4smitadolly wants to merge 4 commits intopgRouting:masterfrom
Conversation
This script has been written based on the fact that reverse length of the unidirectional link is 100000.0 in the routable table. Based on your case in the table, you can edit the value. Also this script is only fot shortest_path and not for shooting start etc.
|
Smita, Thank you for your work. I did a very quick look through your code and if I understand correctly what you mean by point to point is that you are creating a virtual edge by splitting the start and end edges at the point closest to the start and end points. This is nice, thanks. I'll take a closer look tomorrow at the code. One quick comment to simplify the code a lot is the you can use: rather than: when you are only returning one row or a single value. It will make the code much more readable. Thank you for taking the time to make a pull request. |
|
Thanks Stephen, I will make the changes and will commit to github.. On 6 February 2014 11:02, Stephen Woodbridge notifications@github.comwrote:
Smita Kumari Dolly |
Made changes based on the feedback got from Stephen
|
Hello Stephen, I made the changes, tested the script and committed to git-hub. It's working now. |
replaced the single quote by double quote if osm_name have any single quote
Hello Sir,
After getting motivation from you to create a wrapper for point to point routing, I have written this wrapper for point to point shortest path routing. There are scope to improve this more and I will work towards the same. For now, I want to contribute this wrapper to your repository so that other people also can make use of this and give feedback on the same.
Thanks and Regards
Smita Kumari Dolly
Senior Research Engineer,
CSTEP, Bangalore