# How priority queue is used in Dijsktra algorithm?

I have difficulties understanding how the priority queue is used in Dijkstra algorithm. Wikipedia lists 3 operations performed on priority queue:

So do I miss something or I can forget about constant time for decrease_priority (because it only applies from the moment when you have given entry already found)?
Sorry for not adding Dijsktra tag but I am with low rep here.