The PEs receive the data transmitted by another PE after a latency of one clock cycle and hence n +1 clock cycles are required for each iteration instead of n. At the end of a sufficient number of iterations, the cost of the shortestpath from the source node to each node and the predecessor node in the path are stored in the PE corresponding to the node.