How to check whether a number is already in heap

#1

how to keep a check for the number who is getting inserted again ?

#2

hello @kingshuk441
A priority_queue only has 2 operations defined: insert at a given priority, and retrieve the item with the highest priority.it dont support any other operation.

if u want to keep track of inserted element then u can u set or similar datastructure

#3
#4

plz check if it is correct or not if not plz make changes in it

#5

@kingshuk441
store coordinates of elements as well in ur priority queue. and use them to insert next unvisited element.

#6

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.