Dijkstra's algorithm

Hey still i’m confused with why not to use priority queue over set as he said in priority queue we don’t have any update operation we have to delete and insert a node in order to update it but with the set also he’s doing the same, so could you brief a little on this as i’m unable to differentiate between the two over here

hello @msid78641
we can use priority queue as well.
refer this-> link