hw3 Notes:

You are to write MaxBridge.java, from scratch!  But see the hw3
handout for instructions, and do use the files you see in this
directory.   Files:

 movies.txt   a copy of ../book/movies.txt

 book.jar     contains all *.class files from ../book/,
              including the contents of ../book/stdlib.jar

 Movies.java  an example file, that shows how to read
              the graph in movies.txt, and then invoke
              various book graph algorithms on that graph

 Bridge.java  you will probably want to reuse this code in your
              MaxBridge.java, since it already solves the problem
              of detecting all the bridge edges

The Makefile has convenient recipes to compile and run Movies.java
(a finished program) and MaxBridge.java (which you need to write).
In particular:

    make run     -- compile and run your MaxBridge.java
    make turnin  -- turnin your MaxBridge.java (from ~/cs323/hw3/)

As usual you will want to start by making a personal copy of the hw3
files.  You might do that as follows:

     cd ~cs323000/share/hw3
     make copy
     cd ~/cs323/hw3/

Basic advice: use Movies.java just for the code to read the graph.
Use the code from Bridge.java, which recognizes all the bridge edges.
Figure out how to compute the size of each subtree of the DFS tree
(use pre[] and cnt).  Now if we also knew the size of the current
connected component, then that would be enough information to compute
the "size" of each bridge edge when we find it.