A Distributed Algorithm for Shortest Paths

Assuming that there is one processor at each vertex and all of these processors are synchronized, we can have a distributed algorithm for finding all the shortest paths in time O( d · p2) where d is the maximum of the degrees of vertices and p is the number of vertices.