Vidyalelo
Data Structure · Q62

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 62

Q62

Floyd Warshall's Algorithm is used for solving . . . . . . . .

A.
All pair shortest path problems
Answer
B.
Single Source shortest path problems
C.
Network flow problems
D.
Sorting problems

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board
PreviousNext
All Graph Algorithms (DFS, BFS, Dijkstras, etc) questions