Uses of Package org.neo4j.graphdb.traversal (Neo4j Community 2.1.0-M01 API)
Date: 2014-02-20

# Uses of Package
org.neo4j.graphdb.traversal

- Packages that use org.neo4j.graphdb.traversal
  Package | Description
  --- | ---
  org.neo4j.graphalgo | Scalable graph algorithms like shortest path and others for Neo4j which can be easily accessed via `GraphAlgoFactory`.
  org.neo4j.graphdb | The core graph database API.
  org.neo4j.graphdb.traversal | Traversal framework.

- Classes in org.neo4j.graphdb.traversal used by org.neo4j.graphalgo
  Class and Description
  InitialBranchState Factory for initial state of `TraversalBranch`es in a traversal.
  InitialStateFactory Deprecated. use `InitialBranchState` instead, which has got `InitialBranchState.reverse()` as well.
  TraversalMetadata Provides metadata about a traversal.

- Classes in org.neo4j.graphdb.traversal used by org.neo4j.graphdb
  Class and Description
  BidirectionalTraversalDescription Represents a description of a bidirectional traversal.
  BranchState Accessor for a state associated with a `TraversalBranch` during a traversal.
  TraversalDescription Represents a description of a traversal.

- Classes in org.neo4j.graphdb.traversal used by org.neo4j.graphdb.traversal
  Class and Description
  BidirectionalTraversalDescription Represents a description of a bidirectional traversal.
  BranchCollisionDetector 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.
  BranchCollisionPolicies A catalogue of convenient branch collision policies Copied from kernel package so that we can hide kernel from the public API.
  BranchCollisionPolicy Copied from kernel package so that we can hide kernel from the public API.
  BranchOrderingPolicies A catalog of convenient branch ordering policies.
  BranchOrderingPolicy Creator of `BranchSelector` instances with a starting point to base the first decision on.
  BranchSelector Decides "where to go next" in a traversal.
  BranchState Accessor for a state associated with a `TraversalBranch` during a traversal.
  Evaluation Outcome of `Evaluator.evaluate(org.neo4j.graphdb.Path)`.
  Evaluator An Evaluator controls what's to be returned from a traversal and also how pruning is done.
  InitialBranchState Factory for initial state of `TraversalBranch`es in a traversal.
  InitialBranchState.Adapter
  InitialStateFactory Deprecated. use `InitialBranchState` instead, which has got `InitialBranchState.reverse()` as well.
  PathEvaluator A PathEvaluator controls what's to be returned from a traversal and also how pruning is done.
  Paths.PathDescriptor Provides hooks to help build a string representation of a `Path`.
  PruneEvaluator Deprecated. because of the introduction of `Evaluator` which combines `PruneEvaluator` and filtering (`Predicate` of `Path`s).
  SideSelector Dictates which side is the current side in a bidirectional traversal to traverse the next step for.
  SideSelectorPolicies A catalogue of convenient side selector policies for use in bidirectional traversals.
  SideSelectorPolicy A factory for `SideSelector`s.
  TraversalBranch Represents a `position` and a `RelationshipExpander` with a traversal context, for example parent and an iterator of relationships to go next.
  TraversalContext Provides a context for `TraversalBranch`es which they need to move further and report their progress.
  TraversalDescription Represents a description of a traversal.
  TraversalMetadata Provides metadata about a traversal.
  Traverser This interface represents the traverser which is used to step through the results of a traversal.
  Uniqueness A catalogue of convenient uniqueness factories.
  UniquenessFactory Factory for `UniquenessFilter` filters, it can supply the created `UniquenessFilter` with an optional parameter which is up to the filter itself to validate and make sense of.
  UniquenessFilter

Copyright © 2002–2014 The Neo4j Graph Database Project. All rights reserved.