| Last time | Next time |
Here are some old test 2s (these may contain bits of chapters 6 and 7, or earlier bits of chapter 2, but our exam will cover 2.6, 3.1, 5.1 5.2, and 5.3).
I want to continue illustrating how both of Dijkstra's algorithm and Bellman-Ford can be thought of using trees (and recursion).
Again, we can think of these algorithms by using trees. Trees are awfully useful structures!