I'm struggling to get my head around this specific example using Dijkstra's algorithm. Basically, the algorithm (or my possible incorrect interpretation thereof) is getting stuck in a dead end and is not able to reach the end node.
Say we try to find the shortest distance between node A and node G. Starting at A, the closest node is C with a weighting of 3. After assigning 3 to the permanent value of node C, we look at its relevant connections. The total current weightings are as follows:
A -> E = 14
C -> B = 8
C -> D = 19
C -> E = 12
Since node B has the shortest total weighting of 8, we assign its permanent value and move on. Now we've reached a dead end, and I'm really not sure how to continue from here.
As the title suggests, my question is whether it is possible to move on from the dead end and continue the traversal somehow. If so, how?
Thanks in advance