org.gradle.api.internal

Class CachingDirectedGraphWalker<N,T>

java.lang.Object

org.gradle.api.internal.CachingDirectedGraphWalker<N,T>

public class CachingDirectedGraphWalker<N,T>
extends java.lang.Object

A graph walker which collects the values reachable from a given set of start nodes. Handles cycles in the graph. Can be reused to perform multiple searches, and reuses the results of previous searches. Uses a variation of Tarjan's algorithm: http://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm

Constructor Summary

Constructors

Constructor and Description
CachingDirectedGraphWalker(DirectedGraph<N,T> graph)
CachingDirectedGraphWalker(DirectedGraphWithEdgeValues<N,T> graph)

Method Summary

Methods

Modifier and Type	Method and Description
CachingDirectedGraphWalker	add(java.lang.Iterable<? extends N> values) Adds some start nodes.
CachingDirectedGraphWalker<N,T>	add(N... values) Adds some start nodes.
java.util.Set<T>	findValues() Calculates the set of values of nodes reachable from the start nodes.

Methods inherited from class java.lang.Object

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

Constructor Detail

CachingDirectedGraphWalker

public CachingDirectedGraphWalker(DirectedGraph<N,T> graph)

CachingDirectedGraphWalker

public CachingDirectedGraphWalker(DirectedGraphWithEdgeValues<N,T> graph)

Method Detail

add

public CachingDirectedGraphWalker<N,T> add(N... values)

Adds some start nodes.

add

public CachingDirectedGraphWalker add(java.lang.Iterable<? extends N> values)

Adds some start nodes.

findValues

public java.util.Set<T> findValues()

Calculates the set of values of nodes reachable from the start nodes.