M
Explanation by: Mr. Dubey
in prim’s algorithm, we add the minimum weight edge for the chosen vertex which requires searching on the array of weights. this searching can be efficiently implemented using binary heap for dense graphs. and for graphs with greater density, prim’s algorithm can be made to run in linear time using d-ary heap(generalization of binary heap).
You must be Logged in to update hint/solution
Related MCQs
Q. Dennis Was Author Of Famous Programming Book _________ .
Q. In Forward State Space Planning , Progress ( A, S) function returns ___________________
Q. The method of slicing digital messages into parcels, sending them along
Q. The process of quantifying data is referred to as _________.
Q. Which of the followings is the BEST description of Message Passing Interface (MPI)?
Q. whicj command is used for displaying file in archieve
Discusssion
Login to discuss.