Q. Floyd Warshall’s Algorithm can be applied on

  • (A) undirected and unweighted graphs
  • (B) undirected graphs
  • (C) directed graphs
  • (D) acyclic graphs
πŸ’¬ Discuss
βœ… Correct 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.

Explanation by: Mr. Dubey
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.

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
117
Total Visits
πŸ“½οΈ
3 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
94%
Success Rate