In an execution of a distributed program, processes communicate among themselves by
exchanging messages. The execution speed of the program could be expedited by a faster
message delivery system, transmitting messages to their destinations through their
respective shortest paths. Some distributed algorithms have been proposed in recent years
for determining all pairs shortest paths for an arbitrary computer network. The best known
algorithm usesO (n2logn) messages, wherenis the number of computers in the network. This …