Solved #2056
📝 Summary
This PR improves the Dijkstra algorithm implementation to ensure correct handling of priority updates for neighbors in the priority queue

🧠 Problem
In the current implementation, the neighbor’s priority in the queue is only updated if queue.hasValue(neighbor) returns true. This is logically sound only if the PriorityQueue:

Correctly changes the priority of an existing node, and

Does not contain duplicate entries.

If the PriorityQueue does not update priorities properly or allows duplicates, a node may exist multiple times in the queue with different costs — potentially breaking Dijkstra's guarantees.

✅ Fix
Explicitly ensure priority updates are handled correctly even if the node is already present in the queue.

Avoid potential issues caused by multiple entries of the same node with different priorities.