V
 the graph vertex typeE
 the graph edge typepublic interface StrongConnectivityAlgorithm<V,E>
Modifier and Type  Method and Description 

Graph<Graph<V,E>,DefaultEdge> 
getCondensation()
Compute the condensation of the given graph.

Graph<V,E> 
getGraph()
Return the underlying graph.

List<Graph<V,E>> 
getStronglyConnectedComponents()
Computes a list of subgraphs of the given graph.

boolean 
isStronglyConnected()
Returns true if the graph is strongly connected, false otherwise.

List<Set<V>> 
stronglyConnectedSets()

List<DirectedSubgraph<V,E>> 
stronglyConnectedSubgraphs()
Deprecated.
In favor of
getStronglyConnectedComponents() . 
boolean isStronglyConnected()
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 components@Deprecated List<DirectedSubgraph<V,E>> stronglyConnectedSubgraphs()
getStronglyConnectedComponents()
.List<Graph<V,E>> getStronglyConnectedComponents()
Graph<Graph<V,E>,DefaultEdge> getCondensation()
Copyright © 2017. All rights reserved.