I am using pgrouting layer plug-in as described in this post: http://underdark.wordpress.com/2011/12/18/osm2po-part-2-pgrouting-on-osm-the-easy-way/

I am now able to calculate the shortest path using Dijkstra algorithm. I would like to know if it is possible to add to the pgrouting plug-in the A* shortest path algorithm.

Thank you. Selini


I am improving pgRoutingLayer plugin which is based on original pgRoutingLayer plugin.

This one includes all of non-wrapper functions (shortest_path_*/driving_distance/alphashape/tsp).

shortest_path search shortest_path_astar search

  • Great! What is its status? Is it currently functional? – RyanKDalton Aug 31 '12 at 17:38
  • great that you picked it up and improved upon it. feel free to send pull requests. – underdark Aug 31 '12 at 19:58

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.