1. Skip to Menu
  2. Skip to Content
  3. Skip to Footer>

Spring 2011 - Week 2 (January 28, 2011)

Practice ran from 6-10 PM and was attended by 9 students.

The first hour of practice consisted of a discussion of graph algorithms (representations, traversals, and example problems).

As part of the discussion, the following Java code was distributed:

  • Vertex.java
  • MatrixGraph.java
  • DFS.java (& DFSPrint.java which prints a visualization of the search)
  • BFS.java (& BFSPrint.java which prints a visualization of the search)

To practice implementing graph traversals, we solved the following problem as a group:

The problem set consisted of 4 problems (some links go to .pdfs):