I am learning about Dijkstra's Algorithm and the A* Algorithm and I have manually worked through the graph attached here, which is supposed (I think) to demonstrate that the A* Algorithm is faster than the Dijkstra one. The sequence in which I chose the nodes is indicated by the circled numbers. I can see that the process is fairly simple but there are plenty of possibilities for human error, so please bear with me.
My course book says that the A* will be quicker.
I can't see why this is true. Have I worked through the graph incorrectly?
It seems to me that both methods require that all nodes must be visited so where is the increase in efficiency?
I have read what I can on Stack Overflow about this so please don't point me at earlier posts unless there is a very good reason.