vaidehijoshi / basecs-series Goto Github PK

Hi,

I really liked this post: https://medium.com/basecs/finding-the-shortest-path-with-a-little-help-from-dijkstra-613149fbdc8e

I have been studying Dijkstra and I really liked your work! =)

However, there is this error:
"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."

As your own table shows 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.

Keep up the good work, girl!