Class EdgeBasedTarjanSCC.ConnectedComponents
java.lang.Object
com.graphhopper.routing.subnetwork.EdgeBasedTarjanSCC.ConnectedComponents
- Enclosing class:
- EdgeBasedTarjanSCC
-
Method Summary
Modifier and TypeMethodDescriptioncom.carrotsearch.hppc.IntArrayList
A reference to the biggest component contained ingetComponents()
or an empty list if there are either no components or the biggest component has only a single edge (and hencegetComponents()
is empty).List<com.carrotsearch.hppc.IntArrayList>
A list of arrays each containing the edge keys of a strongly connected component.int
com.carrotsearch.hppc.BitSet
The set of edge-keys that form their own (single-edge key) component.int
The total number of strongly connected components.
-
Method Details
-
getComponents
A list of arrays each containing the edge keys of a strongly connected component. Components with only a single edge key are not included here, but need to be obtained usinggetSingleEdgeComponents()
. The edge key is either 2*edgeId (if the edge direction corresponds to the storage order) or 2*edgeId+1 (for the opposite direction). UseGHUtility.getEdgeFromEdgeKey(int)
to convert edge keys back to edge IDs. -
getSingleEdgeComponents
public com.carrotsearch.hppc.BitSet getSingleEdgeComponents()The set of edge-keys that form their own (single-edge key) component. IfEdgeBasedTarjanSCC.excludeSingleEdgeComponents
is enabled this set will be empty. -
getTotalComponents
public int getTotalComponents()The total number of strongly connected components. This always includes single-edge components. -
getBiggestComponent
public com.carrotsearch.hppc.IntArrayList getBiggestComponent()A reference to the biggest component contained ingetComponents()
or an empty list if there are either no components or the biggest component has only a single edge (and hencegetComponents()
is empty). -
getEdgeKeys
public int getEdgeKeys()
-