308-203A Introduction to Computing II Lecture 16: Dijkstra’s Algorithm

11/21/00


Click here to start


Table of Contents

308-203A Introduction to Computing II Lecture 16: Dijkstra’s Algorithm

Graphs with Weighted Edges

Example

Weight of a Path Problems

Shortest-Path Problems

A Hard Problem

A Not-So-Hard Problem

Greedy algorithms

A Greedy Algorithm that Works

A Flawed “Greedy Algorithm”

A Flawed “Greedy Algorithm”

A Flawed “Greedy Algorithm”

Dijkstra’s Algorithm

Dijkstra’s Algorithm

Dijkstra (pseudocode)

Helper Routine

Example

Example

Example

Example

Example

Example

Example

Example

Running time

Proof of Correctness

Any questions?

Author: Alfred Holz

Email: wrenne@acm.org

Home Page: http://www.cs.mcgill.ca/~cs203