Vidyalelo
Data Structure · Q35

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 35

Q35

In which situation is it appropriate to use the Floyd-Warshall algorithm?

A.
When the graph is sparse.
B.
When you need the shortest path between all pairs of nodes.
Answer
C.
When the graph is directed only.
D.
When the graph is sparse.

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board