Regards heap used in video

#1

if we use heap (priority queue) then we don’t have to upheapify?? ( used in the last part of video upheapify part )

#2

hey @amankumar7017
if you are using inbuilt priority queue .
upheapify function will Work internally .

#3

exactly I did the same but output was not correct

#4

@amankumar7017
Do Not use directly
You need to change according to maam

#5

why inbuilt heap(priority queue ) don’t work here ??

#6

@amankumar7017 You need to use a comparator.
If you are learning graph for the first time. i would suggest you , Maam ko follow kro, best rahega

#7

bro if you can provide code for this (which includes priority queue ) then it would be more better to me .

#8

@amankumar7017
Try your self.
Inside the priority queue use a anonymous comparator ,
the elements of the priority queue are ordered by default in natural order .