A walk over the shortest path: Dijkstra s Algorithm viewed as fixed-point computation

Jayadev Misra. A walk over the shortest path: Dijkstra s Algorithm viewed as fixed-point computation. Inf. Process. Lett., 77(2-4):197-200, 2001. [doi]

Abstract

Abstract is missing.