pith. machine review for the scientific record. sign in

arxiv: 1904.01210 · v1 · submitted 2019-04-02 · 💻 cs.DS

Recognition: unknown

Incorrect implementations of the Floyd--Warshall algorithm give correct solutions after three repeats

Authors on Pith no claims yet
classification 💻 cs.DS
keywords algorithmfloyd--warshallcorrectgiveimplementationsincorrectloopsnested
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.