Now, D is the unvisited node with the smallest distance value. By visiting node D, we find a new connection F and update its distance value to 2 + 4 + 4 = 10. This is added to the shortest path as node D gives shortest path from the previous node C.
