Example of Dijkstras algorithm E”← EXTRACT-MIN(Q: B D 10 0(A Q:A B E E 103 S.:{A,C,E} c 2001 by Charles E Leiserson Introduction to Agorithms Day29L17.15© 2001 by Charles E. Leiserson Introduction to Algorithms Day 29 L17.15 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, E } 0 7 3 5 11 10 3−− 7 11 5 “E” ← EXTRACT-MIN(Q):