In this section, I'll teach you Floyd-Warshall, the algorithm that finds shortest paths between ALL pairs of vertices at once.
Instead of running Dijkstra times, you run one algorithm that handles everything, including negative edges. You will see how dynamic programming creates the solution, how to detect negative cycles, and how to reconstruct paths. By the end, you will solve all-pairs problems with confidence.
