🔥 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 →