precomputepaths.java

High performance DB query

/*
 * @(#)$Id: PrecomputePaths.java,v 1.5 2004/07/02 23:59:22 huebsch Exp $
 *
 * Copyright (c) 2001-2004 Regents of the University of California.
 * All rights reserved.
 *
 * This file is distributed under the terms in the attached BERKELEY-LICENSE
 * file. If you do not find these files, copies can be found by writing to:
 * Computer Science Division, Database Group, Universite of California,
 * 617 Soda Hall #1776, Berkeley, CA 94720-1776. Attention: Berkeley License
 *
 * Copyright (c) 2003-2004 Intel Corporation. All rights reserved.
 *
 * This file is distributed under the terms in the attached INTEL-LICENSE file.
 * If you do not find these files, copies can be found by writing to:
 * Intel Research Berkeley, 2150 Shattuck Avenue, Suite 1300,
 * Berkeley, CA, 94704.  Attention:  Intel License Inquiry.
 */


package simulator.schedulers.network.topology.transitstub;

import java.util.Random;

/**
 * Class PrecomputePaths
 *
 */
public class PrecomputePaths {

    /**
     * Method main
     *
     * @param args
     */
    public static void main(String args[]) {
        TransitStub ts = new TransitStub(args[0], false, true, new Random(0));

        ts.generateShortestPaths();
    }
}