EdgeTopologyCompare.java

/* ==========================================
 * JGraphT : a free Java graph-theory library
 * ==========================================
 *
 * Project Info:  http://jgrapht.sourceforge.net/
 * Project Creator:  Barak Naveh (http://sourceforge.net/users/barak_naveh)
 *
 * (C) Copyright 2003-2008, by Barak Naveh and Contributors.
 *
 * This library is free software; you can redistribute it and/or modify it
 * under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation; either version 2.1 of the License, or
 * (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
 * License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this library; if not, write to the Free Software Foundation,
 * Inc.,
 * 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
 */
/* -----------------
 * EdgeTopologyCompare.java
 * -----------------
 * (C) Copyright 2005-2008, by Assaf Lehr and Contributors.
 *
 * Original Author:  Assaf Lehr
 * Contributor(s):   -
 *
 * $Id: EdgeTopologyCompare.java 645 2008-09-30 19:44:48Z perfecthash $
 *
 * Changes
 * -------
 */
package edu.nd.nina.experimental.isomorphism;

import edu.nd.nina.*;
import edu.nd.nina.experimental.isomorphism.GraphOrdering;


/**
 * @author Assaf
 * @since Aug 6, 2005
 */
public class EdgeTopologyCompare
{
    //~ Methods ----------------------------------------------------------------

    /**
     * Compare topology of the two graphs. It does not compare the contents of
     * the vertexes/edges, but only the relationships between them.
     *
     * @param g1
     * @param g2
     */
    @SuppressWarnings("unchecked")
    public static boolean compare(Graph g1, Graph g2)
    {
        boolean result = false;
        GraphOrdering lg1 = new GraphOrdering(g1);
        GraphOrdering lg2 = new GraphOrdering(g2);
        result = lg1.equalsByEdgeOrder(lg2);

        return result;
    }
}

// End EdgeTopologyCompare.java