| edu.umd.cs.findbugs.graph |
|
| Java Source File Name | Type | Comment |
| AbstractDepthFirstSearch.java | Class | Perform a depth first search on a graph.
Algorithm based on Cormen, et. |
| AbstractEdge.java | Class | GraphEdge implementation for use with AbstractGraph. |
| AbstractGraph.java | Class | A simple Graph implementation where the vertex objects
store a list of incoming and outgoing edges. |
| AbstractVertex.java | Class | GraphVertex implementation for use with AbstractGraph. |
| DepthFirstSearch.java | Class | Perform a forward depth first search of a graph. |
| DFSEdgeTypes.java | Interface | Edge types in a depth first search. |
| Graph.java | Interface | Graph interface; defines the operations used to access and manipulate
a graph. |
| GraphEdge.java | Interface | GraphEdge interface; represents an edge in a graph. |
| GraphToolkit.java | Interface | An interface for creating Graph objects,
and for copying auxiliary information in vertices and edges. |
| GraphVertex.java | Interface | GraphVertex interface; represents a vertex in a graph. |
| MergeVertices.java | Class | Algorithm to merge a set of vertices into a single vertex. |
| ReverseDepthFirstSearch.java | Class | Perform a reverse depth first search of a graph. |
| SearchTree.java | Class | SearchTree represents a search tree produced by a graph
search algorithm, such as BreadthFirstSearch or DepthFirstSearch. |
| SearchTreeBuilder.java | Class | A search tree callback implementation that builds a
list of SearchTrees recording a graph search. |
| SearchTreeCallback.java | Interface | Callback interface for building a search tree from
a depth first search. |
| StronglyConnectedComponents.java | Class | Algorithm to find strongly connected components in a graph.
Based on algorithm in Cormen et. |
| Transpose.java | Class | Algorithm to transpose a graph. |
| VertexChooser.java | Interface | VertexChooser specifies an interface for objects that determine
whether or not a vertex is chosen for some purpose. |
| VertexCombinator.java | Interface | Interface for an object which combines a set of vertices into
a single composite vertex; for example,
after finding strongly connected components. |
| VisitationTimeComparator.java | Class | Comparator to compare GraphVertex objects by their visitation times in a
search; for example, it could compare the finishing times produced
by DepthFirstSearch. |