Apologies: I was sick all weekend, and did not get much done, but I
intend to catch up on your written work.

REMINDERS: I gave you hw3 on Friday, it is due Friday (written) or
Saturday (program).  Our midterm exam is Wednesday next week, we'll
start seeing some review (including old exams) this Friday.

For the hw3 program you write MaxBridge.java, a program finding the
max-size bridge edge in movies.txt (the graph of the Kevin Bacon
game).  I'm willing to go over the basic strategy (see also
share/hw3/Notes.txt).  (Nobody has emailed me the solution yet!)
In particular I added some small test inputs to share/hw3/,
files BC4.txt and EF3.txt, possibly I'll add some more.

Next we should go back and talk about the BFS algorithm, how it is
implemented, and why it succeeds in finding shortest paths (pages
51-57 of slides).  I'll also point out that in some sense, BFS and
DFS are both instances of a more general "bag of edges" graph
traversal algorithm (one using a stack, the other using a queue).

Other book codes that might deserve a look:
   ../book/SymbolGraph.java    (build Graph from a file like movies.txt)
   ../book/BreadthFirstPaths.java  (find shortest paths from a source)