I an brushing up on Dijkstra (specifically Wikipedia's pseudocode) and can't resolve this counter example. I want the shortest path between A and E. I would move from A to C to D, where D would have a cost of 105. Once I mark D as visited I no longer have an opportunity to find the correct path A to B to D to E. What am I missing?
Dijkstra Counter Example
algorithms