4 ms·
If you need some "Routing Graph" - check the pgRouting library https://pgrouting.org/ https://pgrouting.org/ "pgRouting library contains following features:
by pella 2y ago
If you need some "Routing Graph" - check the pgRouting library https://pgrouting.org/ 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#graphs https://docs.pgrouting.org/latest/en/pgRouting-concepts.html...
- mycall 2y agoIs it normally preferred to use some library such as this over a more traditional approach of nested sets, adjacency lists or ltree module?
- pella 2y agoPG Database + "The Boost Graph Library (BGL)" C++ ( https://www.boost.org/doc/libs/1_87_0/libs/graph/doc/index.html https://www.boost.org/doc/libs/1_87_0/libs/graph/doc/index.h... )+ PostGIS ==> PGRouting Just check the Workshop : https://workshop.pgrouting.org/3.0/en/index.html https://workshop.pgrouting.org/3.0/en/index.html Pedestrian Routing: https://workshop.pgrouting.org/3.0/en/basic/pedestrian.html#pgr-dijkstra https://workshop.pgrouting.org/3.0/en/basic/pedestrian.html#... Graph views: https://workshop.pgrouting.org/3.0/en/basic/graph_views.html https://workshop.pgrouting.org/3.0/en/basic/graph_views.html Create a Network Topology: https://workshop.pgrouting.org/3.0/en/advanced/chapter-12.html https://workshop.pgrouting.org/3.0/en/advanced/chapter-12.ht...