We explore a similarity between the n by n random assignment problem and the random shortest path problem on the complete graph on n+1 vertices. This similarity is a consequence of the proof of the Parisi formula for the assignment problem given by C. Nair, B. Prabhakar and M. Sharma in 2003. We give direct proofs of the analogs for the shortest path problem of some results established by D. Aldous in connection with his ζ(2) limit theorem for the assignment problem.