lec15

# lec15 - MIT OpenCourseWare http/ocw.mit.edu 6.006...

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

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: 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 . Lecture 15 Shortest Paths I: Intro 6.006 Spring 2008 Lecture 15: Shortest Paths I: Intro Lecture Overview Homework Preview • • Weighted Graphs • General Approach • Negative Edges • Optimal Substructure Readings CLRS, Sections 24 (Intro) Motivation: Shortest way to drive from A to B ( Google maps “get directions” Formulation: Problem on a weighted graph G ( V, E ) W : E → Two algorithms: Dijkstra O ( V lg V + E ) assumes non-negative edge weights Bellman Ford O ( V E ) is a general algorithm Problem Set 5 Preview: • Use Dijkstra to find shortest path from CalTech to MIT – See “CalTech Cannon Hack” photos (search web.mit.edu – See Google Maps from CalTech to MIT • Model as a weighted graph G ( V, E ) ,W : E → – V = vertices (street intersections) – E = edges (street, roads);...
View Full 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 / 7

lec15 - 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
Ask a homework question - tutors are online