Graphs. Breadth-first and depth-first search. Connectivity and topological sorting. Dijkstra's algorithm. Closest pair in the plane. Teaching. 20 hours of ... E Leiserson & R L Rivest, Introduction to ...