V
 vertex concept typeE
 edge concept typepublic interface StrongConnectivityAlgorithm<V,E>
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
StrongConnectivityAlgorithm instance is strongly connected. 
List<Set<V>> 
stronglyConnectedSets()

List<DirectedSubgraph<V,E>> 
stronglyConnectedSubgraphs()
Computes a list of
DirectedSubgraph s of the given graph. 
DirectedGraph<V,E> getGraph()
boolean isStronglyConnected()
StrongConnectivityAlgorithm
instance is strongly connected.List<Set<V>> stronglyConnectedSets()
List
of Set
s, where each set contains vertices which together form
a strongly connected component within the given graph.List
of Set
s containing the strongly connected componentsList<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.
Copyright © 2017. All rights reserved.