Shortest Path Problem (SSP)

🔥 all-pairs shortest path → All-pairs shortest path leverages single-source shortest path routines: run SSSP from every vertex (e.g., repeated Dijkstra for nonnegative weights, Bellman–Ford for negative edges) or use Johnson’s algorithm (reweighting + Dijkstra). Even Floyd–Warshall computes the same shortest-path notion; understanding SSSP is required to choose and implement these methods correctly.

🔥 single-source shortest path → Single-source shortest path refines the general shortest path problem to computing minimum-cost paths from one fixed source to all nodes, applying the same cost model and constraints and selecting suitable algorithms (e.g., BFS for unweighted, Dijkstra for positive weights, Bellman–Ford for negative edges).

🔥 single-pair shortest path → Single-pair shortest path depends on the general shortest-path formulation (cost models, edge weights) and the standard algorithms (BFS, Dijkstra, Bellman-Ford, A*) specialized to a single source-target query.

🌟 dijkstra algorithm →

⚡️ floyd-warshall algorithm →

⚡️ bellman-ford algorithm →

⚡️ a star search →