Schedule of Topics

Friday, May 12: Sorting (pages 260-281)

Monday, May 15: finish Sorting, do Union-Find (pages 303-311)

Wednesday, May 17: start Graphs (pages 327-330, plus handout on graph matching)

Friday, May 19, finish graph matching and discuss Program 3

Monday, May 22, continue Program 3, do topological sort

Wednesday, May 24, shortest path algorithms (pages 330-347)

Friday, May 26, more graph algorithms (pages 351 and 356-362)

Monday, May 29 NO CLASS MEMORIAL DAY

Wednesday, May 31 applications

Friday, June 2 Review