We’ll check its unvisited neighbor (it only has one, node e), and calculate the distance to e, from the origin node, via our current vertex, b.
Finding The Shortest Path, With A Little Help From Dijkstra
Vaidehi Joshi

Node d is also unvisited, not just e.

Also there’s a mismatch in images part 5 and part 6. Previous vertex of d changes from c in part 5 to b in part 6, which gives wrong explanation for shortest path from a to d in subsequent part of the post.

Like what you read? Give Rohit Nagmoti a round of applause.

From a quick cheer to a standing ovation, clap to show how much you enjoyed this story.