Package org.neo4j.graphdb.traversal
package org.neo4j.graphdb.traversal
Traversal framework.
-
ClassDescriptionRepresents a description of a bidirectional traversal.In a bidirectional traversal there's one traversal from each start/end side and they will probably meet somewhere in the middle and the full paths are formed.A catalogue of convenient branch collision policies, see
BranchCollisionPolicy
A `BranchCollisionPolicy` defines when a collision is detected and accepted in a bidirectional traversal, seeBidirectionalTraversalDescription
.A catalog of convenient branch ordering policies.Creator ofBranchSelector
instances with a starting point to base the first decision on.Decides "where to go next" in a traversal.BranchState<STATE>Accessor for a state associated with aTraversalBranch
during a traversal.Outcome ofEvaluator.evaluate(org.neo4j.graphdb.Path)
.An Evaluator controls what's to be returned from a traversal and also how pruning is done.Evaluator.AsPathEvaluator<STATE>Exposes anEvaluator
as aPathEvaluator
.CommonEvaluator
s useful during common traversals.InitialBranchState<STATE>Factory for initial state ofTraversalBranch
es in a traversal.InitialBranchState.State<STATE>Branch state evaluator for an initial state.PathEvaluator<STATE>A PathEvaluator controls what's to be returned from a traversal and also how pruning is done.PathEvaluator.Adapter<STATE>Adapter forPathEvaluator
.Utilities forPath
objects.Paths.DefaultPathDescriptor<T extends Path>The defaultPaths.PathDescriptor
used in common toString() representations in classes implementingPath
.Paths.PathDescriptor<T extends Path>Provides hooks to help build a string representation of aPath
.Dictates which side is the current side in a bidirectional traversal to traverse the next step for.A catalogue of convenient side selector policies for use in bidirectional traversals.A factory forSideSelector
s.Represents aposition
and aPathExpander
with a traversal context, for example parent and an iterator of relationships to go next.Provides a context forTraversalBranch
es which they need to move further and report their progress.Represents a description of a traversal.Provides metadata about a traversal.This interface represents the traverser which is used to step through the results of a traversal.A catalog of convenient uniqueness factories.Factory forUniquenessFilter
filters, it can supply the createdUniquenessFilter
with an optional parameter which is up to the filter itself to validate and make sense of.Interface for filters preventing the traversal from visiting already seen parts of the graph.