Single-Source Shortest Path (SSSP)

🔥 Dijkstra Algorithm → Dijkstra's algorithm depends on the SSSP formulation: it solves SSSP on graphs with non-negative edge weights by applying edge relaxation ordered via a priority queue, and its correctness is framed in SSSP terms.

🔥 Bellman-Ford Algorithm → Bellman–Ford solves the single-source shortest path problem, applying repeated edge relaxation and negative-cycle detection to handle graphs with negative weights; understanding the SSSP objective and relaxation model is required to implement and analyze Bellman–Ford.

🔥 Directed Acyclic Graph → SSSP techniques (relaxation, edge-weight handling) enable linear-time path algorithms on DAGs via topological ordering; many DAG tasks (shortest/longest paths, scheduling) are specialized SSSP formulations that reuse these ideas.

🌟 Breadth First Search →

Single-Pair Shortest Path →

All-Pairs Shortest Path →