Vidyalelo
Data Structure · Q89

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 89

Q89

Floyd Warshall Algorithm can be used for finding . . . . . . . .

A.
Transitive closure
Answer
B.
Minimum spanning tree
C.
Topological sort
D.
Single source shortest path

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