KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > edu > umd > cs > findbugs > plan > ConstraintGraph


1 /*
2  * FindBugs - Find bugs in Java programs
3  * Copyright (C) 2004, University of Maryland
4  *
5  * This library is free software; you can redistribute it and/or
6  * modify it under the terms of the GNU Lesser General Public
7  * License as published by the Free Software Foundation; either
8  * version 2.1 of the License, or (at your option) any later version.
9  *
10  * This library is distributed in the hope that it will be useful,
11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13  * Lesser General Public License for more details.
14  *
15  * You should have received a copy of the GNU Lesser General Public
16  * License along with this library; if not, write to the Free Software
17  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18  */
19
20 package edu.umd.cs.findbugs.plan;
21
22 import edu.umd.cs.findbugs.graph.AbstractGraph;
23
24 /**
25  * Graph of Detector ordering constraints.
26  * It may represent ordering constraints between analysis passes,
27  * or ordering constraints within a single pass.
28  * Edges flow from earlier detectors to later detectors.
29  *
30  * @see DetectorNode
31  * @see ConstraintEdge
32  * @see ExecutionPlan
33  * @author David Hovemeyer
34  */
35 public class ConstraintGraph
36     extends AbstractGraph<ConstraintEdge, DetectorNode>
37 {
38     @Override JavaDoc
39          protected ConstraintEdge allocateEdge(DetectorNode source, DetectorNode target) {
40         return new ConstraintEdge(source, target);
41     }
42     
43     @Override JavaDoc
44     public String JavaDoc toString() {
45         return "ConstraintGraph[Vertices: " + getNumVertices() + " Edges: " + getNumEdges() + "]";
46     }
47 }
48
49 // vim:ts=4
50
Popular Tags