{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Tables 2.7

# Tables 2.7 - Dijkstra’s algorithm Dijkstra’s algorithm...

This preview shows pages 1–5. Sign up to view the full content.

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

View Full Document

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Dijkstra’s algorithm Dijkstra’s algorithm can be viewed as greedy, since it always chooses the “lightest” vertex in V S to add to S. CSE 2011 Prof. J. Elder - 196 - Last Updated: 4/1/10 10:16 AM Dijkstra’s algorithm: Analysis Analysis: Using minheap, queue operations takes O(logV) time CSE 2011 Prof. J. Elder - 197 - Last Updated: 4/1/10 10:16 AM Example CSE 2011 Prof. J. Elder Key: White Grey Black - 198 - Vertex Q = V - S Vertex = min(Q) Vertex S, Off Queue Last Updated: 4/1/10 10:16 AM Example CSE 2011 Prof. J. Elder - 199 - Last Updated: 4/1/10 10:16 AM Example CSE 2011 Prof. J. Elder - 200 - Last Updated: 4/1/10 10:16 AM ...
View Full Document

{[ snackBarMessage ]}

### Page1 / 5

Tables 2.7 - Dijkstra’s algorithm Dijkstra’s algorithm...

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

View Full Document
Ask a homework question - tutors are online