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