All-Pairs Shortest Path (APSP)

🔥 Floyd-Warshall Algorithm → Implements → All-Pairs Shortest Path (APSP) The APSP problem specification drives the goals, inputs, outputs, and correctness criteria that the Floyd–Warshall algorithm fulfills.

🔥 Dijkstra Algorithm → Enables → All-Pairs Shortest Path (APSP) Understanding APSP’s problem framing and trade-offs (density, negative edges, cycle checks) lets one reason about when Dijkstra is valid and efficient as part of an APSP strategy.

🔥 Johnson Algorithm → Prerequisite For → All-Pairs Shortest Path (APSP) The APSP formulation and goals drive the design and application of Johnson's algorithm as a solution for certain graph classes.

Single-Source Shortest Path →

Single-Pair Shortest Path →