The document discusses Floyd's algorithm for finding the shortest paths between all pairs of vertices in a graph. It presents the problem, defines the graph as one containing negative edges but no negative cycles. It then shows the representation using a weight matrix and provides the recursive definition of Floyd's algorithm, which works by iteratively updating the weight matrix to find the shortest paths using intermediate vertices. Pseudocode for Floyd's algorithm is also presented.
The document discusses Floyd's algorithm for finding the shortest paths between all pairs of vertices in a graph. It presents the problem, defines the graph as one containing negative edges …