Example of Dijkstras algorithm “D”< EXTRACT-MIN(Q:7 B D 10 0(A ABCD E E 103 S:A, C,E, B, DI c 2001 by Charles E Leiserson Introduction to Agorithms Day29L17.19© 2001 by Charles E. Leiserson Introduction to Algorithms Day 29 L17.19 Example of Dijkstra’s algorithm AA BB DD CC EE 10 3 14 79 8 2 2 Q: ABCDE 0 ∞∞∞∞ S: { A, C, E, B, D } 0 7 3 5 9 10 3∞∞ 7 11 5 7 11 9 “D” ← EXTRACT-MIN(Q):