Note: have project idea and group by Friday, April 1 (formal submission details will be on Moodle)

Opening activity: Dijkstra’s practice!

• Union-find data structure
• Topological sort - Source removal algorithm
• Topological sort with DFS (optional)
• Horspool's Algorithm (if time?)