import rpi.goldsd.graph.*;

public class DFSTest
{
  public static void main( String[] args )
  {
    int numVertices = 25;
    double prob = 0.2;
    Graph G = new Graph( "Random Graph", numVertices, prob );

    while ( ! G.isConnected() )
    {
      System.out.println( "Graph is not connected --- regenerating ..." );
      G = new Graph( "Random Graph", numVertices, prob );
    }

    G.printSummary();
    Tree T = Algorithms.depthFirstTraversal( G );
    T.printSummary();

//    Algorithms.toGraphDraw( G, "DFSTest1.html" );
//    Algorithms.toGraphDraw( T, "DFSTest2.html" );
  }
}