Floyd–Warshall algorithm

The floyd–warshall algorithm is like a shortcut for finding the fastest way to get from one point to another. It looks at all of the different paths between the two points and the length of each path. Then it finds the shortest path between the two points and suggests that one as the fastest way. It's like a map when you want to get from one place to another: it looks at all the different roads and then finds the shortest one for you to take.