V
 the graph vertex typeE
 the graph edge typepublic class KosarajuStrongConnectivityInspector<V,E> extends Object implements StrongConnectivityAlgorithm<V,E>
Complements the ConnectivityInspector
class with the capability to
compute the strongly connected components of a directed graph. The algorithm is implemented after
"Cormen et al: Introduction to agorithms", Chapter 22.5. It has a running time of O(V + E).
Unlike ConnectivityInspector
, this class does not implement incremental
inspection. The full algorithm is executed at the first call of
stronglyConnectedSets()
or
isStronglyConnected()
.
Constructor and Description 

KosarajuStrongConnectivityInspector(DirectedGraph<V,E> directedGraph)
The constructor of the StrongConnectivityAlgorithm class.

Modifier and Type  Method and Description 

DirectedGraph<V,E> 
getGraph()
Returns the graph inspected by the StrongConnectivityAlgorithm.

boolean 
isStronglyConnected()
Returns true if the graph of this
StronglyConnectivityInspector instance is strongly connected. 
List<Set<V>> 
stronglyConnectedSets()

List<DirectedSubgraph<V,E>> 
stronglyConnectedSubgraphs()
Computes a list of
DirectedSubgraph s of the given graph. 
public KosarajuStrongConnectivityInspector(DirectedGraph<V,E> directedGraph)
directedGraph
 the graph to inspectIllegalArgumentException
 if the input graph is nullpublic DirectedGraph<V,E> getGraph()
getGraph
in interface StrongConnectivityAlgorithm<V,E>
public boolean isStronglyConnected()
StronglyConnectivityInspector
instance is strongly connected.isStronglyConnected
in interface StrongConnectivityAlgorithm<V,E>
public List<Set<V>> stronglyConnectedSets()
List
of Set
s, where each set contains vertices which together form
a strongly connected component within the given graph.stronglyConnectedSets
in interface StrongConnectivityAlgorithm<V,E>
List
of Set
s containing the strongly connected componentspublic List<DirectedSubgraph<V,E>> stronglyConnectedSubgraphs()
Computes a list of DirectedSubgraph
s of the given graph. Each subgraph will represent
a strongly connected component and will contain all vertices of that component. The subgraph
will have an edge (u,v) iff u and v are contained in the strongly connected component.
NOTE: Calling this method will first execute
stronglyConnectedSets()
. If you don't need
subgraphs, use that method.
stronglyConnectedSubgraphs
in interface StrongConnectivityAlgorithm<V,E>
Copyright © 2016. All rights reserved.