MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), - Lec 17 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005

Master Algorithm Design with MIT's Foundational Course

5.0 (1)

8 learners

What you'll learn

Analyze algorithm efficiency using asymptotic notation
Apply divide-and-conquer strategies to solve problems
Implement and analyze fundamental graph algorithms
Design algorithms using dynamic programming and greedy techniques

This course includes

30 hours of video
Certificate of completion
Access on mobile and TV

Summary

Keywords

Shortest Paths Properties Dijkstra's Algorithm Breadth-first Search

Full Transcript

Lecture 17: Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search View the complete course at: http://ocw.mit.edu/6-046JF05 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu