lec18 - MIT OpenCourseWare http/ocw.mit.edu 6.006...

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

View Full Document Right Arrow Icon
MIT OpenCourseWare http://ocw.mit.edu 6.006 Introduction to Algorithms Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms .
Background image of page 1

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

View Full DocumentRight Arrow Icon
Lecture 18 Shortest Paths III: Dijkstra 6.006 Spring 2008 Lecture 18: Shortest Paths IV - Speeding up Dijkstra Lecture Overview Single-source single-target Dijkstra Bidirectional search Goal directed search - potentials and landmarks Readings Wagner, Dorothea, and Thomas Willhalm. "Speed-Up Techniques for Shortest-Path Computations." In Lecture Notes in Computer Science: Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science . Berlin/Heidelberg, MA: Springer, 2007. ISBN: 9783540709176. Read up to section 3.2. DIJKSTRA single-source, single-target Initialize() Q V [ G ] while Q = φ do u EXTRACT MIN(Q) (stop if u = t !) for each vertex v Adj [ u ] do RELAX ( u, v, w ) Observation: If only shortest path from s to t is required, stop when t is removed from Q , i.e.,
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/24/2010 for the course CS 6.006 taught by Professor Erikdemaine during the Spring '08 term at MIT.

Page1 / 6

lec18 - MIT OpenCourseWare http/ocw.mit.edu 6.006...

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

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