I am trying to produce a routing functionality in a web-GIS that, given a start and an end point, will retrieve the least cost path taking into account points along edges representing major costs, thus avoiding them. I would like to ask what I could do to start producing this function. I have a graph with edges and nodes, I have points representing costs along edges, I have quite a good knowledge of Python and I was thinking to use PostGIS to store my data. I had a look at the pgRouting extension of PostGIS and it seems to be the solution I am looking for. Anyway I would like to ask someone more experienced to provide advice on what I need, what I need to know and how to get started.


  • PG_Routing is good and powerfull tool, but maybe for your needs osm2po or osrm will be enough (of course it works on osm data prepared by themselves, not on pg database with topology) – Jendrusk May 15 '14 at 12:31
  • It also highly depends on the speed you need. Have a look at alternatives for OpenStreetMap data: wiki.openstreetmap.org/wiki/Routing – Karussell May 16 '14 at 12:43

Your Answer

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

Browse other questions tagged or ask your own question.