LibraryUtils.java

// GraphTea Project: http://github.com/graphtheorysoftware/GraphTea
// Copyright (C) 2012 Graph Theory Software Foundation: http://GraphTheorySoftware.com
// Copyright (C) 2008 Mathematical Science Department of Sharif University of Technology
// Distributed under the terms of the GNU Lesser General Public License (LGPL): http://www.gnu.org/licenses/

package graphtea.library.algorithms.util;

import graphtea.library.BaseEdge;
import graphtea.library.BaseGraph;
import graphtea.library.BaseVertex;
import graphtea.library.algorithms.Algorithm;
import graphtea.library.algorithms.goperators.EdgeInduced;
import graphtea.library.algorithms.goperators.GraphComplement;
import graphtea.library.algorithms.goperators.GraphUnion;
import graphtea.library.algorithms.goperators.VertexInduced;

import java.util.Collection;
import java.util.Iterator;

/**
 * @see graphtea.plugins.main.core.AlgorithmUtils
 */
public class LibraryUtils {

    public static <VertexType extends BaseVertex, EdgeType extends BaseEdge<VertexType>>
    boolean falsifyEdgeMarks(BaseGraph<VertexType, EdgeType> g) {
        boolean flag = false;
        EdgeType e;
        Iterator<EdgeType> iet = g.edgeIterator();
        while (iet.hasNext()) {
            e = iet.next();
            flag |= e.getMark();
            e.setMark(false);
        }
        return flag;
    }

    public static <VertexType extends BaseVertex, EdgeType extends BaseEdge<VertexType>>
    boolean falsifyVertexMarks(BaseGraph<VertexType, EdgeType> g) {
        boolean flag = false;
        for (VertexType v : g) {
            flag |= v.getMark();
            v.setMark(false);
        }
        return flag;
    }

    /**
     * @see graphtea.library.algorithms.goperators.GraphComplement#complement(graphtea.library.BaseGraph)
     */
    public static <VertexType extends BaseVertex, EdgeType extends BaseEdge<VertexType>>
    BaseGraph<VertexType, EdgeType>
    complement(BaseGraph<VertexType, EdgeType> g1) {
        return GraphComplement.complement(g1);
    }

    /**
     * @see graphtea.library.algorithms.goperators.EdgeInduced#edgeInduced(graphtea.library.BaseGraph,java.util.Collection)
     */
    public static <VertexType extends BaseVertex, EdgeType extends BaseEdge<VertexType>>
    BaseGraph<VertexType, EdgeType> edgeInduced(BaseGraph<VertexType, EdgeType> g, Collection<EdgeType> S) {
        return EdgeInduced.edgeInduced(g, S);
    }

    /**
     * @see graphtea.library.algorithms.goperators.VertexInduced#induced(graphtea.library.BaseGraph,java.util.Collection)
     */
    public static <VertexType extends BaseVertex, EdgeType extends BaseEdge<VertexType>>
    BaseGraph<VertexType, EdgeType> induced(BaseGraph<VertexType, EdgeType> g, Collection<VertexType> S) {
        return VertexInduced.induced(g, S);
    }

    /**
     * @see graphtea.library.algorithms.goperators.GraphUnion#join(graphtea.library.BaseGraph,graphtea.library.BaseGraph)
     */
    public static <VertexType extends BaseVertex, EdgeType extends BaseEdge<VertexType>>
    BaseGraph<VertexType, EdgeType> join(BaseGraph<VertexType, EdgeType> g1, BaseGraph<VertexType, EdgeType> g2) {
        return GraphUnion.union(g1, g2);
    }

    /**
     * @see graphtea.library.algorithms.util.EventUtils#algorithmStep(graphtea.library.algorithms.Algorithm,String)
     */
    public static void algorithmStep(Algorithm a, String message) {
        EventUtils.algorithmStep(a, message);
    }

    /**
     * returns all vertex marks in a array
     */
    public static <VertexType extends BaseVertex, EdgeType extends BaseEdge<VertexType>>
    boolean[] getVertexMarks(BaseGraph<VertexType, EdgeType> g) {
        boolean ret[] = new boolean[g.getVerticesCount()];
        int i = 0;
        for (BaseVertex v : g) {
            ret[i++] = v.getMark();
        }
        return ret;
    }

    /**
     * sets all the vertex marks
     */
    public static <VertexType extends BaseVertex, EdgeType extends BaseEdge<VertexType>>
    void setVertexMarks(BaseGraph<VertexType, EdgeType> g, boolean verexMarks[]) {
        int i = 0;
        for (BaseVertex v : g) {
            v.setMark(verexMarks[i++]);
        }
    }

}