Vidyalelo
Data Structure · Q46

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 46

Q46

Prim's algorithm can be efficiently implemented using . . . . . . . . for graphs with greater density.

A.
d-ary heap
Answer
B.
linear search
C.
fibonacci heap
D.
binary search

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