This is a reduced version of the rtg program made by Limeng Wei at USC.  This make
a graph of the given number of nodes with the options of makeing the graoh
connected or not.  The original code had other option such as displaying the graph
under X-Windows.  

To make a graph with 100 nodes (connected), try
% rtg -n100 -c

The seed used for the random graoh generation ensures that as long as the seed is
the same, the graph with the same number of nodes is also the same.  To make a
different graph with 100 nodes (connected), try
% rtg -n100 -c -s##
where ## is a 16-bit numbre which will be used as the seed to generate randon
numbers.  

The edges are built using the WAXMAN edge distribution, which can be controlled by
two parameters, Alpha and Beta.  The default values are 0.4 and 0.4.  However, you
can set these by the -a and -b options.

The graph is made with a target degree in mind.  This can also be specified by the
-t option.  For more help on usage, try rtg -h.

Shahzad Ali
5/3/98
University of Delaware.
