edu.umd.cs.findbugs.graph (FindBugs ${release.number} API)

Package edu.umd.cs.findbugs.graph

Interface Summary
DFSEdgeTypes	Edge types in a depth first search.
Graph<EdgeType,VertexType>	Graph interface; defines the operations used to access and manipulate a graph.
GraphEdge<ActualEdgeType,VertexType>	GraphEdge interface; represents an edge in a graph.
GraphToolkit<GraphType,EdgeType,VertexType>	An interface for creating Graph objects, and for copying auxiliary information in vertices and edges.
GraphVertex<ActualVertexType>	GraphVertex interface; represents a vertex in a graph.
SearchTreeCallback<VertexType>	Callback interface for building a search tree from a depth first search.
VertexChooser<VertexType>	VertexChooser specifies an interface for objects that determine whether or not a vertex is chosen for some purpose.
VertexCombinator<VertexType>	Interface for an object which combines a set of vertices into a single composite vertex; for example, after finding strongly connected components.

Interface Summary

DFSEdgeTypes

Edge types in a depth first search.

Graph<EdgeType,VertexType>

Graph interface; defines the operations used to access and manipulate a graph.

GraphEdge<ActualEdgeType,VertexType>

GraphEdge interface; represents an edge in a graph.

GraphToolkit<GraphType,EdgeType,VertexType>

An interface for creating Graph objects, and for copying auxiliary information in vertices and edges.

GraphVertex<ActualVertexType>

GraphVertex interface; represents a vertex in a graph.

SearchTreeCallback<VertexType>

Callback interface for building a search tree from a depth first search.

VertexChooser<VertexType>

VertexChooser specifies an interface for objects that determine whether or not a vertex is chosen for some purpose.

VertexCombinator<VertexType>

Interface for an object which combines a set of vertices into a single composite vertex; for example, after finding strongly connected components.

Class Summary
AbstractDepthFirstSearch<GraphType,EdgeType,VertexType>	Perform a depth first search on a graph.
AbstractEdge<ActualEdgeType,VertexType>	GraphEdge implementation for use with AbstractGraph.
AbstractGraph<EdgeType,VertexType>	A simple Graph implementation where the vertex objects store a list of incoming and outgoing edges.
AbstractVertex<EdgeType,ActualVertexType>	GraphVertex implementation for use with AbstractGraph.
DepthFirstSearch<GraphType,EdgeType,VertexType>	Perform a forward depth first search of a graph.
MergeVertices<GraphType,EdgeType,VertexType>	Algorithm to merge a set of vertices into a single vertex.
ReverseDepthFirstSearch<GraphType,EdgeType,VertexType>	Perform a reverse depth first search of a graph.
SearchTree<VertexType>	SearchTree represents a search tree produced by a graph search algorithm, such as BreadthFirstSearch or DepthFirstSearch.
SearchTreeBuilder<VertexType>	A search tree callback implementation that builds a list of SearchTrees recording a graph search.
StronglyConnectedComponents<GraphType,EdgeType,VertexType>	Algorithm to find strongly connected components in a graph.
Transpose<GraphType,EdgeType,VertexType>	Algorithm to transpose a graph.
VisitationTimeComparator<VertexType>	Comparator to compare GraphVertex objects by their visitation times in a search; for example, it could compare the finishing times produced by DepthFirstSearch.

Class Summary

AbstractDepthFirstSearch<GraphType,EdgeType,VertexType>

Perform a depth first search on a graph.

AbstractEdge<ActualEdgeType,VertexType>

GraphEdge implementation for use with AbstractGraph.

AbstractGraph<EdgeType,VertexType>

A simple Graph implementation where the vertex objects store a list of incoming and outgoing edges.

AbstractVertex<EdgeType,ActualVertexType>

GraphVertex implementation for use with AbstractGraph.

DepthFirstSearch<GraphType,EdgeType,VertexType>

Perform a forward depth first search of a graph.

MergeVertices<GraphType,EdgeType,VertexType>

Algorithm to merge a set of vertices into a single vertex.

ReverseDepthFirstSearch<GraphType,EdgeType,VertexType>

Perform a reverse depth first search of a graph.

SearchTree<VertexType>

SearchTree represents a search tree produced by a graph search algorithm, such as BreadthFirstSearch or DepthFirstSearch.

SearchTreeBuilder<VertexType>

A search tree callback implementation that builds a list of SearchTrees recording a graph search.

StronglyConnectedComponents<GraphType,EdgeType,VertexType>

Algorithm to find strongly connected components in a graph.

Transpose<GraphType,EdgeType,VertexType>

Algorithm to transpose a graph.

VisitationTimeComparator<VertexType>

Comparator to compare GraphVertex objects by their visitation times in a search; for example, it could compare the finishing times produced by DepthFirstSearch.