import rpi.goldsd.graph.*;

public class BFSTest
{
  public static void main( String[] args )
  {
    int numVertices = 200;
    double prob = 0.15;
    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( false );
    Tree T = Algorithms.breadthFirstTraversal( G );
    T.printSummary( false );

//    Algorithms.toGraphDraw( G, "BFSTest1.html" );
//    Algorithms.toGraphDraw( T, "BFSTest2.html" );
  }
}