Single-Pair Shortest Path (SPSP)

🔥 a star search → A* is an informed algorithm for the single-pair shortest path problem; it augments Dijkstra’s with an admissible/consistent heuristic to focus expansion toward the goal, relying on single-pair termination and path reconstruction.

🔥 bidirectional search → Bidirectional search extends single-pair shortest path by running two coordinated searches from the source and target (e.g., BFS/Dijkstra variants), using the same optimality criteria and parent-pointer reconstruction, and stopping when the frontiers meet to reduce explored states.

⚡️ single-source shortest path →

⚡️ all-pairs shortest path →