/*
 * FindBugs - Find bugs in Java programs
 * Copyright (C) 2004, University of Maryland
 * 
 * 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
 */

package edu.umd.cs.findbugs.plan;

import edu.umd.cs.findbugs.graph.AbstractGraph;

/**
 * Graph of Detector ordering constraints.
 * It may represent ordering constraints between analysis passes,
 * or ordering constraints within a single pass.
 * Edges flow from earlier detectors to later detectors.
 *
 * @see DetectorNode
 * @see ConstraintEdge
 * @see ExecutionPlan
 * @author David Hovemeyer
 */
public class ConstraintGraph
	extends AbstractGraph<ConstraintEdge, DetectorNode>
{
	@Override
         protected ConstraintEdge allocateEdge(DetectorNode source, DetectorNode target) {
		return new ConstraintEdge(source, target);
	}
	
	@Override
	public String toString() {
		return "ConstraintGraph[Vertices: " + getNumVertexLabels() + " Edges: " + getNumEdgeLabels() + "]";
	}
}

// vim:ts=4

/*
 * FindBugs - Find bugs in Java programs
 * Copyright (C) 2004, University of Maryland
 * 
 * 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
 */

package edu.umd.cs.findbugs.plan;

import edu.umd.cs.findbugs.graph.AbstractGraph;

/**
 * Graph of Detector ordering constraints.
 * It may represent ordering constraints between analysis passes,
 * or ordering constraints within a single pass.
 * Edges flow from earlier detectors to later detectors.
 *
 * @see DetectorNode
 * @see ConstraintEdge
 * @see ExecutionPlan
 * @author David Hovemeyer
 */
public class ConstraintGraph
	extends AbstractGraph<ConstraintEdge, DetectorNode>
{
	@Override
         protected ConstraintEdge allocateEdge(DetectorNode source, DetectorNode target) {
		return new ConstraintEdge(source, target);
	}
	
	@Override
	public String toString() {
		return "ConstraintGraph[Vertices: " + getNumVertices() + " Edges: " + getNumEdges() + "]";
	}
}

// vim:ts=4

fix toString (don't use the getNumXX(Label) version)