dijkstracomparator.java

来自「High performance DB query」· Java 代码 · 共 53 行

/*
 * @(#)$Id: DijkstraComparator.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.Comparator;

/**
 * Class DijkstraComparator
 *
 */
public class DijkstraComparator implements Comparator {

    /**
     * Method compare
     *
     * @param o1
     * @param o2
     * @return
     */
    public int compare(Object o1, Object o2) {
        int int1 = ((Integer) o1).intValue();
        int int2 = ((Integer) o2).intValue();

        if (int1 > int2) {
            return 1;
        }

        if (int1 < int2) {
            return -1;
        }

        return 0;
    }
}