com.graphhopper.routing.subnetwork

Class TarjansSCCAlgorithm

java.lang.Object

com.graphhopper.routing.subnetwork.TarjansSCCAlgorithm

public class TarjansSCCAlgorithm
extends Object

Implementation of Tarjan's algorithm using an explicit stack. The traditional recursive approach runs into stack overflow pretty quickly. The algorithm is used within GraphHopper to find strongly connected components to detect dead-ends leading to routes not found and it is used for landmark calculation as well.

See http://en.wikipedia.org/wiki/Tarjan's_strongly_connected_components_algorithm. See http://www.timl.id.au/?p=327 and http://homepages.ecs.vuw.ac.nz/~djp/files/P05.pdf

Constructor Summary

Constructors

Constructor and Description
TarjansSCCAlgorithm(Graph graph, BooleanEncodedValue accessEnc, boolean excludeSingleNodeComponents)

Method Summary

Modifier and Type	Method and Description
List<com.carrotsearch.hppc.IntArrayList>	findComponents() Find and return a list of all strongly connected components of g.
void	setAdditionalEdgeFilter(EdgeFilter additionalFilter) Allows adding an additional edge filter to exclude edges while searching for connected components.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

TarjansSCCAlgorithm

public TarjansSCCAlgorithm(Graph graph,
                           BooleanEncodedValue accessEnc,
                           boolean excludeSingleNodeComponents)

Method Detail

setAdditionalEdgeFilter

public void setAdditionalEdgeFilter(EdgeFilter additionalFilter)

Allows adding an additional edge filter to exclude edges while searching for connected components.

findComponents

public List<com.carrotsearch.hppc.IntArrayList> findComponents()

Find and return a list of all strongly connected components of g. Components with only a single node will be excluded from the result depending on excludeSingleNodeComponents