edu.umd.cs.findbugs.graph

Class AbstractGraph<EdgeType,VertexType>

public abstract class AbstractGraph<EdgeType extends AbstractEdge<EdgeType,VertexType>,VertexType extends AbstractVertex<EdgeType,VertexType>> extends 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

Constructor Summary
	AbstractGraph()

Method Summary
void	addVertex(VertexType v)
protected abstract EdgeType	allocateEdge(VertexType source, VertexType target)
boolean	containsVertex(VertexType v)
EdgeType	createEdge(VertexType source, VertexType target)
Iterator<EdgeType>	edgeIterator()
int	getNumEdgeLabels()
int	getNumEdges()
int	getNumIncomingEdges(VertexType vertex)
int	getNumOutgoingEdges(VertexType vertex)
int	getNumVertexLabels()
int	getNumVertices()
Iterator<EdgeType>	incomingEdgeIterator(VertexType target)
EdgeType	lookupEdge(VertexType source, VertexType target)
Iterator<EdgeType>	outgoingEdgeIterator(VertexType source)
Iterator<VertexType>	predecessorIterator(VertexType target)
void	removeEdge(EdgeType edge)
void	removeVertex(VertexType v)
void	setNumEdgeLabels(int numLabels)
void	setNumVertexLabels(int numLabels)
Iterator<VertexType>	successorIterator(VertexType source)
Iterator<VertexType>	vertexIterator()