I know about the Floyd algorithm becuase it was in the "Network Flows: Theory, Algorithms, and Applicatons" textbook by Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin in my graduate level course on that topic.  Markus provided us with references about that algorithm, as well as the code to implement it, in past discussions on this group with Mike over several years on this same issue.  I followed the entire exchange here and Markus did not start the discussion with the false statement Mike claims.   On the contrary, I am certain that Markus explicitly acknowledged the python program would probably work as it is currently written.  To restore some credibility for yourself Mike, how about arranging to correct the code to make it O(N^3)?  All this time Mike is wasting futiley trying to beat down Markus could be better spent by soliciting help from someone who codes python to modify the code.  Then again, your attacks on Markus are so completely false and nasty that I really doubt there is anything you can do to restore your credibility with me.

Mike said
What started this discussion was when Markus said that my BeatpathWinner
algorithm wouldn't work, because it isn't the Floyd algorithm, whatever that
is.