We went over BFS today as an alternative algorithm to travel through a graph. I hope all of you were able to implement BFS, but if not, then please try to do that in your spare time so that you are familiar with the implementation. Feel free to reach out and ask questions on anything you might be confused about. For your homework, work on the practice problems we started near the end of class. Here is the bronze problem: http://www.usaco.org/index.php?page=viewproblem2&cpid=939. Here is the silver problem: http://www.usaco.org/index.php?page=viewproblem2&cpid=644. And finally, if you are up for another problem after those two, here's a more challenging bonus one: http://www.usaco.org/index.php?page=viewproblem2&cpid=788.
top of page
bottom of page