Floyd Warshall
Q1. Is it possible to use the Floyd Warshall algorithm to find transitive closure of a graph?
Q2. We can use the Floyd Warshall algorithm to detect negative weight cycles in a graph.
Q3. The shortest distance between node 0 and 3 is :
Q4. The shortest distance between node 0 and 3 is :