Floyd-Warshall algorithm finds shortest paths of any length using dynamic programming

The Floyd-Warshall algorithm finds shortest paths between all graph vertices without assuming a maximum path length. It iteratively refines path estimates by considering each vertex as a potential intermediate point, naturally accommodating paths of any length. This dynamic programming approach is optimal for dense graphs but less efficient for sparse ones, handling negative edge weights unless negative cycles exist.