Tables 2.9 - Correctness of Dijkstra’s Algorithm: Upper...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Correctness of Dijkstra’s Algorithm: Upper Bound Property Upper Bound Property: • Proof: A valid path from s to v! CSE 2011 Prof. J. Elder - 206 - Last Updated: 4/1/10 10:16 AM Correctness of Dijkstra’s Algorithm Optimal substructure property! Handled CSE 2011 Prof. J. Elder - 207 - Last Updated: 4/1/10 10:16 AM Correctness of Dijkstra’s Algorithm Handled CSE 2011 Prof. J. Elder - 208 - Last Updated: 4/1/10 10:16 AM Correctness of Dijkstra’s algorithm Loop invariant: d[v] = (s, v) for all v in S. Maintenance: Need to show that d[u] = (s, u) when u is added to S in each iteration. d[u] does not change once u is added to S. CSE 2011 Prof. J. Elder - 209 - ? Last Updated: 4/1/10 10:16 AM ...
View Full Document

Page1 / 4

Tables 2.9 - Correctness of Dijkstra’s Algorithm: Upper...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online