FunWithGraphs Toy problems, classic algorithms and genomics applications Maze Search: A* graph search with priority queue Greedy SCS: Greedy Shortest Common Superstring Optimized using a network of look-up tables: O(n) in the number of reads