Home > Data Structures and Algorithms 🚀 > Draw a Graph > An Illustrated Guide to Dijkstra's Algorithm Show previous contentThe unvisited node with smallest distance value is now B. Since visiting B does not open any new paths, the distance values of nodes remain unchanged, and it is also not added to the path. B now moves to the visited node list. Show following content