Exercise: Johnson’s Algorithm

Explore how to apply Johnson’s algorithm to compute shortest path lengths between all pairs of vertices in a directed graph. This exercise helps you understand the mechanics of the algorithm through hands-on problem solving and interactive checks, reinforcing concepts in the context of all-pairs shortest paths.