1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. Floyd Warshall’s Algorithm can be applie...

Floyd Warshall’s Algorithm can be applied on                      

A. undirected and unweighted graphs
B. undirected graphs
C. directed graphs
D. acyclic graphs
Answer» C. directed graphs
Explanation: floyd warshall algorithm can be applied in directed graphs. from a given directed graph, an adjacency matrix is framed and then all pair shortest path is computed by the floyd warshall algorithm.