public class StronglyConnectedComponents<GraphType extends Graph<EdgeType,VertexType>,EdgeType extends GraphEdge<EdgeType,VertexType>,VertexType extends GraphVertex<VertexType>>
extends java.lang.Object
Constructor | Description |
---|---|
StronglyConnectedComponents() |
Constructor.
|
Modifier and Type | Method | Description |
---|---|---|
void |
findStronglyConnectedComponents(GraphType g,
GraphToolkit<GraphType,EdgeType,VertexType> toolkit) |
Find the strongly connected components in given graph.
|
java.util.Iterator<SearchTree<VertexType>> |
searchTreeIterator() |
Returns an iterator over the search trees containing the
vertices of each strongly connected component.
|
java.util.Iterator<java.util.Set<VertexType>> |
setIterator() |
Returns an iterator over the sets of vertices
of each strongly connected component.
|
void |
setVertexChooser(VertexChooser<VertexType> vertexChooser) |
Specify a VertexChooser object to restrict which vertices are
considered.
|
public void setVertexChooser(VertexChooser<VertexType> vertexChooser)
public void findStronglyConnectedComponents(GraphType g, GraphToolkit<GraphType,EdgeType,VertexType> toolkit)
g
- the graphtoolkit
- a GraphToolkit, used to create temporary graphs
used by the algorithmpublic java.util.Iterator<SearchTree<VertexType>> searchTreeIterator()
public java.util.Iterator<java.util.Set<VertexType>> setIterator()
FindBugs™ is licenced under the LGPL. Copyright © 2006 University of Maryland.