Now node E and F have similar distance values. Proceeding in lexicographic order, we will visit node E first. This does not add to the shortest path and does not change the distance values of nodes either.
Mark As Completed Discussion
Back to course sections
