Dijkstra's Algorithm Run-Through Example

A bi-directional graph with ten nodes is run through Dijkstra's algorithm and the distance labels are updated at each iteration.