What procedure is being followed in Floyd Warshall Algorithm?Marks : 1Negative Marks : 0Answer hereTop downBottom upBig bangSandwich

The Floyd-Warshall algorithm follows a procedure that is best described by the "Bottom up" approach. This algorithm is used for finding the shortest paths in a weighted graph with positive or negative edge weights but no negative cycles.

Explanation:

1. Initialization: Start by setting the distance to each vertex from itself as zero and the distance between different vertices as the weight of the edge connecting them. For vertices not directly connected, initialize the distance as infinity.
2. Dynamic Programming: The algorithm iteratively updates the distance matrix by considering whether a path through an intermediate vertex offers a shorter path between two vertices than previously recorded. Specifically, for each vertex $k$, update the distance between every pair of vertices $i$ and $j$ using the relation: $d[i][j] = \min(d[i][j], d[i][k] + d[k][j])$
3. Final Output: After processing all vertices, the resulting distance matrix contains the shortest distances between every pair of vertices.

Therefore, the correct answer to the question is Bottom up.