Example of Dijkstra’s algorithm Graph with B D nonnegative 10 edge weights: E c 2001 by Charles E Leiserson Introduction to Agorithms Day29L17.9© 2001 by Charles E. Leiserson Introduction to Algorithms Day 29 L17.9 Example of Dijkstra’s algorithm AA BB DD CC EE 10 3 14 79 8 2 2 Graph with nonnegative edge weights: