back

by pella·1y ago·view on hn ↗
If you need some "Routing Graph" - check the pgRouting library https://pgrouting.org/

  "pgRouting library contains following features:
  All Pairs Shortest Path, Johnson’s Algorithm
  All Pairs Shortest Path, Floyd-Warshall Algorithm
  Shortest Path A*
  Bi-directional Dijkstra Shortest Path
  Bi-directional A\* Shortest Path
  Shortest Path Dijkstra
  Driving Distance
  K-Shortest Path, Multiple Alternative Paths
  K-Dijkstra, One to Many Shortest Path
  Traveling Sales Person
  Turn Restriction Shortest Path (TRSP)"\*

see more: https://docs.pgrouting.org/latest/en/pgRouting-concepts.html...
1 comments
Is it normally preferred to use some library such as this over a more traditional approach of nested sets, adjacency lists or ltree module?