Graphs

After the class punted the midterm en masse, the professor for Algorithms warned us that the material was going to get harder. I'm sure he didn't mean that as an empty threat but, for me, it's easier. Maybe I just have more experience with dynamic programming approaches to multidimensional problems, but I'm finding that analyzing graph algorithms is a lot easier than analyzing recurrences. To each their own, I guess.