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