Course Notes, Practice Problems, and Solutions
All the graph information is found on this page.
For week 3, you are responsible for graph introduction material
and breadth/depth-first search. For week 4, it's Dijkstra's algorithm.
Week 3: Graphs, Depth/Breadth-first
Graphs introduction, Depth-First Search
Breadth-First Search
Week 4: Dijkstra's shortest path algorithm
Dijkstra's Shortest Path
Video (me going over Dijkstra example in the notes):
Dijkstra's Shortest Path example
Supplementary material week 3
Video (Algorithms with Attitude):
Introduction to Graphs
Video (Algorithms with Attitude):
Graph representations
Video (Kevin Drumm):
Breadth-first and Depth-first Search
Supplementary material week 4
Video (Kevin Drumm):
Dijkstra's Shortest Path algorithm
Practice Problems
List the depth-first and breadth-first ordering.
Assume node numbers represent storage order:
Directed graph
... solution
Graph problems
..................
solution
Dijkstra practice problems
..........
Solutions
Dijkstra practice problem