In the Dijkstra algorithm walkthrough, at 9:03 minutes, In the third row of the table, the already visited nodes in the tree is { A, B, C}. To reach the other nodes in the network using the already visited tree, the correct minimum distance from A to E is 7 (A to B: 3 + B to E: 4). Additionally, in the fourth row {A, B, C, F}, the minimum distance to E is 5. { A -> E -> F } is 5.
