A randomized parallel linked residual network Gr =(V'£j) is presented. Algorithmically the residual network, which produces successive shortest path distances and the original graph G=(V,E) is solved. This result is optimum ...