Q.

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.
618
0
Do you find this helpful?
1

Discussion

No comments yet