Vidyalelo
Data Structure · Q98

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 98

Q98

Kruskal's algorithm is used to . . . . . . . .

A.
find minimum spanning tree
Answer
B.
find single source shortest path
C.
find all pair shortest path algorithm
D.
traverse the graph

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