root/trunk/Test.java

// Test - copyright Tom Felker, <tfelker2@uiuc.edu>, December 2004
//
// Runnable class that does a simple test of the AStarSearch
// which is a part of UIUC Pathways

import java.io.*;
import java.util.*;

class Test {
        public static void main(String argv[]) throws IOException, ClassNotFoundException {

                int xSize, ySize, n;
                double wiggle, criscross;
                String filename = null;

                try {
                        xSize = Integer.parseInt(argv[0]);
                        ySize = Integer.parseInt(argv[1]);
                        wiggle = Double.parseDouble(argv[2]);
                        criscross = Double.parseDouble(argv[3]);
                        n = Integer.parseInt(argv[4]);
                        if(argv.length > 5) filename = argv[5];
                } catch(Exception e) {
                        System.out.println("Usage - java Test xSize ySize wiggle criscross searches [filename]");
                        System.exit(1);
                        return;
                }

                System.out.println("Creating regular " + xSize + "x" + ySize +
                                   " grid with " + wiggle + " wiggle and " +
                                   criscross + " chance for criscross...");

                long time = System.currentTimeMillis();

                Graph graph = new Graph();
                graph.createRegularGrid(xSize, ySize, wiggle, criscross);

                time = System.currentTimeMillis() - time;
                System.out.println("Done in " + time + " milliseconds.");

                if(filename != null) {
                        System.out.println("Saving graph to " + filename);
                        graph.saveToFile(filename);
                        System.out.println("Filesize is " + (new File(filename)).length() + " bytes.");
                        System.out.println("Reading in from file...");
                        graph = null;
                        System.gc();
                        time = System.currentTimeMillis();
                        graph = Graph.loadFromFile(filename);
                        time = System.currentTimeMillis() - time;
                        System.out.println("Done in " + time + " milliseconds.");
                }

                // this is how you use a search object...
                AStarSearch search = new AStarSearch();
                search.setWalkingSpeed(1);


                double averageCostComparisons = 0, averagePathLength = 0, averagePathCost = 0;

                System.out.println("Performing " + n + " random searches.");

                time = System.currentTimeMillis();

                for(int i = 0; i < n; ++i) {
                        search.setOrigin((PhysicalNode)graph.getRandomNode());
                        search.setDestination((PhysicalNode)graph.getRandomNode());
                        // perform the actual search
                        Cost.comparisonCounter = 0;
                        Path path = search.computeBestPath();
                        if(path == null) path = new Path();
                        averageCostComparisons += Cost.comparisonCounter;
                        averagePathLength += path.edges.size();
                        averagePathCost += path.getTotalCost().getTime();
                }
                time = System.currentTimeMillis() - time;
                double averageTime = (double)time / n;
                averageCostComparisons /= n;
                averagePathLength /= n;
                averagePathCost /= n;
                System.out.println("Done");
                System.out.println("Average search time in milliseconds: " + averageTime);
                System.out.println("Average Cost comparisons: " + averageCostComparisons);
                System.out.println("Average path length: " + averagePathLength);
                System.out.println("Average path cost: " + averagePathCost);
                System.out.println("In CSV format,");
                System.out.println(averageTime + "," + averageCostComparisons +
                                   "," + averagePathLength + "," + averagePathCost);
        }
}