Explain Floyd's algorithm
It is convenient to record the lengths of shortest paths in an n by n matrix D known as the distance matrix: the element d_{ij }in the i_{th } row and the j_{th} column of this matrix shows the length of the shortest path from the i_{th }vertex to the j_{th} vertex . We can make the distance matrix with an algorithm that is very same to warshall's algorithm. It is known as Floyd's algorithm.