It shows how to use the re-weighting technique we introduced in the last video to reduce the all pair shortest path problem in graphs that can have negative edge lengths to a single invocation of the Bellman-Ford shortest path algorithm followed by N invocations of Dijkstra's shortest path algorithm. 