Shortest Path Problem (SSP)

🔥 All-Pairs Shortest Path → Prerequisite For → Shortest Path Problem (SSP) Mastery of single-source shortest path concepts and constraints provides the foundation to design, analyze, and select efficient APSP algorithms and their correctness/complexity trade-offs.

🔥 Single-Source Shortest Path → Extends → Shortest Path Problem (SSP) Mastery of shortest path concepts and algorithm selection provides the conceptual and algorithmic basis for formulating and solving the single-source variant.

🔥 Single-Pair Shortest Path → Prerequisite For → Shortest Path Problem (SSP) Shortest path provides the definitions and algorithmic toolkit that enable reasoning about correctness, optimality, and complexity in the single-pair case.

🌟 Dijkstra Algorithm →

A Star →

Floyd-Warshall Algorithm →

Bellman-Ford Algorithm →

A Star Search →