Is it possible to have a version of Floyd's Algorithm of just O(|v|^2)?
If yes, what would it be?

Thanks.

- The Floyd's Algorithm is a common algorithm to find shortest paths in weighted graphs of O(|v|^3) -.