The mazeRoute program is a simple global router using maze routing.

An input file can be specified by the option -f filename.  The input
file format can be found by looking at the file
~kastner/projects/input/inputFormat.txt.  There are also many input
files in the input directory.

The -l <filename> option will output the lengths of the routes for the
nets into the specified file.

The -d <filename> option will output the congestion into a file which
can be displayed by my java congestion program. 

The -r option does nothing yet, it might, in the future allow the maze
router to route to the closest net point, and not it's parent from a
minimum spanning tree.

The -%s <x> option will route the smallest x% of the nets (sorting
using bounding box) with a quick one bend routing.  Also, these nets
will not be considered for rip and reroute.

The -%l <x> option will route the largest x% of the nets (sorting
using bounding box) with a quick one bend routing.  Also, these nets
will not be considered for rip and reroute.

The -2 option will split all the nets into two terminals nets
according to the minimum spanning tree and route these nets.

The -b option will route the nets according to their bounding box.
This means that only the bounding box of the net will have routing.
The routing will not be complete i.e., all of the terminals of the net
might not be connected, only those on the bounding box perimeter.

