Lecture18-shortestpaths2

Lecture18-shortestpaths2 - This work is licensed under a...

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

View Full Document Right Arrow Icon
CS 312: Algorithm Analysis Lecture #18: Shortest Paths, part 2 This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License. Slides by: Eric Ringger, adapting figures from Dasgupta et al.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Announcements § HW #11 § Due today § Project #3 § Final proofs: due tomorrow! § Questions? § Mid-Term Exam § Next week § Prepare your review questions now
Background image of page 2
Objectives § Discuss another viewpoint on Dijkstra’s algorithm § Examine possible Priority Queue implementations and their impact on efficiency of Dijkstra’s § Consider special cases
Background image of page 3

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

View Full DocumentRight Arrow Icon
Correctness of Dijkstra’s ntext: Graphs with non-negative edge weights Settled Region, or
Background image of page 4
Correctness of Dijkstra’s Context: Graphs with non-negative edge weights
Background image of page 5

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

View Full DocumentRight Arrow Icon
3 Questions § Is it correct? § Yes! § How long does it take? § Let’s have a look § Can we do better?
Background image of page 6
Dijkstra’s Analysis :
Background image of page 7

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

View Full DocumentRight Arrow Icon
Dijkstra’s
Background image of page 8
Cost § Dijkstra’s requires: § 1 makequeue <= |V| insert § |V| deletemin § |E| decreasekey operations § Insert and decreasekey operations take
Background image of page 9

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

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

This note was uploaded on 03/02/2012 for the course C S 312 taught by Professor Jones,m during the Winter '08 term at BYU.

Page1 / 29

Lecture18-shortestpaths2 - This work is licensed under a...

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

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