Hello, and welcome to competitive programming. Today we are going to talk about Floyd Warshall’s algorithm to find the shortest paths between every pair of vertices.
Objectives Your objectives are to be able to implement the Floyd Warshall algorithm, to know the upper limit of the graph size for which this will work, and some of the problems that this algorithm can solve.