β
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