The document is about the Floyd-Warshall algorithm, which is repeated over 20 times. The Floyd-Warshall algorithm is an algorithm for finding shortest paths in a weighted graph. It improves on Dijkstra's algorithm by finding shortest paths between all pairs of vertices instead of just from a single source vertex selected in advance.