I am getting problem to implement dijsktra's algorithm using priority queue(MIN heap).

Question

But when priority(distance) are changed of vertex.So I have to search those vertex in priority queue(MIN heap) which distance are updated.How to find position of that vertex in binary min heap because find operation are not present in binary min heap?

Comments

Will you like to share the code, cant understand anything.

Put a problem in such a way so that a unknown person can understand the problem and provide you the solution (Hope you don't mind).