Shortest Path

• For many problems the best representation is a directed graph with weighted edges representing, e.g., distance, time, cost.

• Dijkstra’s shortest path algorithm finds the lowest cost path in O(n2).

Read

assignment

Go to

TA hours

Write

pseudocode

Simulate

by hand

Write/debug

Java

1

3

6

1

24

16

2

Go to

TA hours

Previous slide

Next slide

Back to first slide

View graphic version