@neilit1992 yes that’s how it works, like a version of bfs for weighted edges. Once you pop a vertex from a bfs queue it doesn’t get updated again. Similar thing happens here 
Interestingly, the situation where a popped vertex may be required to get updated again is with negative weights, and that’s why Dijkstra’s algorithm is said to not work for negative weights.
1 Like