AbstractGraph (FindBugs 1.3.9 API)

Overview

Package

Class

Use

Tree

Deprecated

Index

Help

FindBugs™ 1.3.9

PREV CLASS NEXT CLASS

FRAMES NO FRAMES

SUMMARY: NESTED | FIELD | CONSTR | METHOD

DETAIL: FIELD | CONSTR | METHOD

edu.umd.cs.findbugs.graph
Class AbstractGraph<EdgeType extends AbstractEdge<EdgeType,VertexType>,VertexType extends AbstractVertex<EdgeType,VertexType>>

java.lang.Object
  edu.umd.cs.findbugs.graph.AbstractGraph<EdgeType,VertexType>

All Implemented Interfaces:: Graph<EdgeType,VertexType>

Direct Known Subclasses:: CallGraph, CFG, ConstraintGraph, InheritanceGraph, InterproceduralCallGraph

public abstract class AbstractGraph<EdgeType extends AbstractEdge<EdgeType,VertexType>,VertexType extends AbstractVertex<EdgeType,VertexType>>
extends java.lang.Object
implements Graph<EdgeType,VertexType>
extends java.lang.Object
implements Graph<EdgeType,VertexType>

A simple Graph implementation where the vertex objects store a list of incoming and outgoing edges. The edge link fields are stored in the edge objects, which means a fairly low space overhead.

The abstract allocateEdge() method must be implemented.

Author:: David Hovemeyer
See Also:: Graph, AbstractEdge, AbstractVertex

Constructor Summary
`AbstractGraph()`

Method Summary
`void`	`addVertex(VertexType v)` Add given vertex to the graph.
`protected abstract EdgeType`	`allocateEdge(VertexType source, VertexType target)`
`boolean`	`containsVertex(VertexType v)` Determine if the graph contains the given vertex.
`EdgeType`	`createEdge(VertexType source, VertexType target)` Add a new edge to the graph.
`java.util.Iterator<EdgeType>`	`edgeIterator()` Get Iterator over all edges in the graph.
`int`	`getNumEdgeLabels()` Get the number of numeric labels that have been assigned to edges.
`int`	`getNumEdges()` Get number of edges in the graph.
`int`	`getNumIncomingEdges(VertexType vertex)` Get number of edges going into given vertex.
`int`	`getNumOutgoingEdges(VertexType vertex)` Get number of edges going out of given vertex.
`int`	`getNumVertexLabels()` Get the number of numeric (integer) labels that have been assigned to vertices in the graph.
`int`	`getNumVertices()` Get number of vertices in the graph.
`java.util.Iterator<EdgeType>`	`incomingEdgeIterator(VertexType target)` Get an Iterator over incoming edges to a given vertex.
`EdgeType`	`lookupEdge(VertexType source, VertexType target)` Look up an edge by source and target vertex.
`java.util.Iterator<EdgeType>`	`outgoingEdgeIterator(VertexType source)` Get an Iterator over outgoing edges from given vertex.
`java.util.Iterator<VertexType>`	`predecessorIterator(VertexType target)` Get an iterator over the predecessors of this vertex; i.e., the sources of the vertex's incoming edges.
`void`	`removeEdge(EdgeType edge)` Remove given edge from the graph.
`void`	`removeVertex(VertexType v)` Remove given vertex from the graph.
`void`	`setNumEdgeLabels(int numLabels)` Reset the number of edge labels.
`void`	`setNumVertexLabels(int numLabels)` Reset number of (integer) labels.
`java.util.Iterator<VertexType>`	`successorIterator(VertexType source)` Get an iterator over the successors of this vertex; i.e., the targets of the vertex's outgoing edges.
`java.util.Iterator<VertexType>`	`vertexIterator()` Get Iterator over all vertices in the graph.

Methods inherited from class java.lang.Object
`clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`

Constructor Detail

AbstractGraph

public AbstractGraph()

Method Detail