I'm currently working on a travel routing application and would like to implement my own version of Dijsktras or A*.

I've been looking at PostGres & PostGIS for storing OSM data, added using tools such as OSM2PO.

I know there are tools such as pgrouting that can be used, but is there any resources/guides on how one would avoid pgrouting and create a custom route algorithm?

The end goal is to show a shortest path route from A -> B (possible waypoints) on a map such as OpenLayers.

closed as unclear what you're asking by user30184, whyzar, aldo_tapia, BERA, mgri Nov 8 '17 at 8:15

Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.

  • 1
    Is there a reason you don't want to use pgRouting - the work has already been done, especially when dealing with OSM data... – DPSSpatial Nov 7 '17 at 18:52
  • It's for an academic project, whereby implementing the algorithm is required. I can't use a purely canned solution – Travisty Nov 7 '17 at 19:26
  • First you will need a graph with nodes, edges and costs but I do not quite understand what is your question. – user30184 Nov 7 '17 at 21:06
  • I would like to perform my own implementation of an algorithm such as Dijkstra's on OSM data. I can import it into a DB such as PostGres using parser tools, but wanted to know how I could actually implement the algorithm myself instead of using pgrouting. I'm sure others have done it before, but I can't find any information – Travisty Nov 7 '17 at 21:17
  • 2
    Have you considered to read some academic papers about routing algorithms and the source code of pgRouting? – user30184 Nov 7 '17 at 21:54