- Dijkstra's algorithm first looks for the lowest weights from A to connected nodes. C is 4, but B is 3 and is preferred.
- Every route from A is mapped,
- Route from \(A \rightarrow B \rightarrow C\) is discarded as \(A \rightarrow B\) is better. The entire graph is now mapped.