All shortest distances in a graph. An improvement to Dantzig's inductive algorithm

Yves Tabourier. All shortest distances in a graph. An improvement to Dantzig's inductive algorithm. Discrete Mathematics, 4(1):83-87, 1973. [doi]

Abstract

Abstract is missing.