"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)"\*
Just check the Workshop : https://workshop.pgrouting.org/3.0/en/index.html
Pedestrian Routing:
https://workshop.pgrouting.org/3.0/en/basic/pedestrian.html#...
Graph views:
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.ht...