Parallel all-pairs shortest path algorithm

A central problem in algorithmic graph theory is the shortest path problem. Hereby, the problem of finding the shortest path between every pair of nodes is known as all-pair-shortest-paths (APSP) problem.

Source: Wikipedia — Parallel all-pairs shortest path algorithm (CC BY-SA 4.0)