CALCULATING THE WARSHALL/FLOYD PATH ALGORITHM
RC Roland Backhouse · TU/e Research Portal · 1992
A calculational derivation is given of an all• pairs path algorithm two instances of which are Warshall's reach ability algorithm and Floyd's shortest-path algorithm.The derivation provides an elementary example of the importance of the so-called star-decomposition rule.