CSC 301.01, Class 28: Shortest paths

Overview

• Preliminaries
  • Notes and news
  • Upcoming work
  • Extra credit
  • Questions
• The shortest-path problem.
• Dijkstra’s shortest-path algorithm.
• Analyzing Dijkstra’s shortest-path algorithm.
• All-pairs shortest-path algorithms

News / Etc.

Upcoming work

• Assignment 8 due next Wednesday at 10:30 p.m. (All written problems!)

Extra credit (Academic/Artistic)

Extra credit (Peer)

• RTS Friday at 9 p.m.
• VR club Sundays at 8pm in ???.

Extra Credit (Misc)

Other good things

Questions

The shortest-path problem.

Dijkstra’s shortest-path algorithm.

Analyzing Dijkstra’s shortest-path algorithm.

All-pairs shortest-path algorithms