Example of Dijkstra’s algorithm Relax all edges leaving b: B D 10 0(A Q:A B C D E E 103 S:A, C,E, B) c 2001 by Charles E Leiserson Introduction to Agorithms Day29L1718© 2001 by Charles E. Leiserson Introduction to Algorithms Day 29 L17.18 Example of Dijkstra’s algorithm AA BB DD CC EE 10 3 14 79 8 2 2 Q: ABC D E 0 ∞∞∞∞ S: { A, C, E, B } 0 7 3 5 9 10 3∞∞ 7 11 5 7 11 Relax all edges leaving B: 9