Untitled
By: a guest | Mar 21st, 2010 | Syntax:
None | Size: 2.79 KB | Hits: 44 | Expires: Never
import java.io.IOException;
import java.util.Arrays;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.io.IOException;
import cs303.Stopwatch;
import cs303.Data;
import cs303.Timing;
import cs303.Graph;
public class Demo {
public static void main(String args[]) throws IOException
{
Data data = new Data();
Timing t = new Timing();
Graph test=new Graph(3,3,15);
int graphCount;
int N=1;
boolean runBFS=true;
System.out.println(test.BFS().length);
// System.out.println();
// test.print();
/*
System.out.println("ONE!");
for (; N<201;N += 1)
{
Graph g = new Graph(2,2,N);
t.startRun(N);
// g.BFS();
// g.numNodes();
g.newBFS();
t.stopRun();
t.printRun(N);
t.outputRuns("BranchBFS.csv");
}
N=1;
System.out.println("TWO!");
for (; N<201;N += 1)
{
Graph g = new Graph(N,2,2);
t.startRun(N);
// g.BFS();
// g.numNodes();
g.newBFS();
t.stopRun();
t.printRun(N);
t.outputRuns("CompBFS.csv");
}
N=1;
System.out.println("THREE!");
for (; N<201;N += 1)
{
Graph g = new Graph(2,N,2);
t.startRun(N);
// g.BFS();
g.newBFS();
// g.numNodes();
t.stopRun();
t.printRun(N);
t.outputRuns("DepthBFS.csv");
}
N=1;
System.out.println("FOUR!");
for (; N<201;N += 1)
{
Graph g = new Graph(2,N,2);
t.startRun(N);
g.numComponents();
t.stopRun();
t.printRun(N);
t.outputRuns("DepthDFS.csv");
}
N=1;
System.out.println("FIVE!");
for (; N<201;N += 1)
{
Graph g = new Graph(N,2,2);
t.startRun(N);
g.numComponents();
t.stopRun();
t.printRun(N);
t.outputRuns("CompDFS.csv");
}
N=1;
System.out.println("SIX!");
for (; N<201;N += 1)
{
Graph g = new Graph(2,2,N);
t.startRun(N);
g.numComponents();
t.stopRun();
t.printRun(N);
t.outputRuns("BranchDFS.csv");
}
*/
}
}