In a nutshell
Floyd-Warshall finds the shortest distance between every pair of vertices at once, not just from a single source. It keeps a grid of best-known distances and, one vertex at a time, allows that vertex as an intermediate stop: for every pair it checks whether routing through the new stop is shorter. After every vertex has had its turn, the grid holds all the true shortest distances.