  The Floyd--Warshall algorithm is a well-known algorithm for the all-pairs
shortest path problem that is simply implemented by triply nested loops. In
this study, we show that the incorrect implementations of the Floyd--Warshall
algorithm that misorder the triply nested loops give correct solutions if these
are repeated three times.
