FloydWarshall example.svg en Demonstration of FloydWarshall algorithm for allpairs shortest path on directed graph with vertices At prior to the first iteration of the outer loop the only known paths correspond to single edges in the original graph At paths that go through the vertex are found in particular the path is found