Uses of Interface
org.neo4j.graphdb.RelationshipExpander

Packages that use RelationshipExpander

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.

Uses of RelationshipExpander in org.neo4j.graphalgo

Methods in org.neo4j.graphalgo with parameters of type RelationshipExpander

Modifier and Type	Method and Description
static PathFinder<Path>	GraphAlgoFactory.allPaths(RelationshipExpander expander, int maxDepth) Returns an algorithm which can find all available paths between two nodes.
static PathFinder<Path>	GraphAlgoFactory.allSimplePaths(RelationshipExpander expander, int maxDepth) Returns an algorithm which can find all simple paths between two nodes.
static PathFinder<WeightedPath>	GraphAlgoFactory.aStar(RelationshipExpander expander, CostEvaluator<Double> lengthEvaluator, EstimateEvaluator<Double> estimateEvaluator) Returns a PathFinder which uses the A* algorithm to find the cheapest path between two nodes.
static PathFinder<WeightedPath>	GraphAlgoFactory.dijkstra(RelationshipExpander expander, CostEvaluator<Double> costEvaluator) Returns a PathFinder which uses the Dijkstra algorithm to find the cheapest path between two nodes.
static PathFinder<WeightedPath>	GraphAlgoFactory.dijkstra(RelationshipExpander expander, String relationshipPropertyRepresentingCost) Deprecated. In favor for GraphAlgoFactory.dijkstra(PathExpander, String) See GraphAlgoFactory.dijkstra(PathExpander, CostEvaluator) for documentation. Uses a cost evaluator which uses the supplied property key to represent the cost (values of type double).
static PathFinder<Path>	GraphAlgoFactory.pathsWithLength(RelationshipExpander expander, int length) Returns an algorithm which can find simple all paths of a certain length between two nodes.
static PathFinder<Path>	GraphAlgoFactory.shortestPath(RelationshipExpander expander, int maxDepth) Returns an algorithm which can find all shortest paths (that is paths with as short Path.length() as possible) between two nodes.
static PathFinder<Path>	GraphAlgoFactory.shortestPath(RelationshipExpander expander, int maxDepth, int maxHitCount) Returns an algorithm which can find all shortest paths (that is paths with as short Path.length() as possible) between two nodes.
static PathFinder<Path>	GraphAlgoFactory.shortestPath(RelationshipExpander expander, int maxDepth, org.neo4j.graphalgo.impl.path.ShortestPath.ShortestPathPredicate predicate)

Uses of RelationshipExpander in org.neo4j.graphdb

Subinterfaces of RelationshipExpander in org.neo4j.graphdb

Modifier and Type	Interface and Description
interface	Expander Deprecated. Deprecated because RelationshipExpander is deprecated. See PathExpander instead.

Methods in org.neo4j.graphdb that return RelationshipExpander

Modifier and Type	Method and Description
RelationshipExpander	RelationshipExpander.reversed() Deprecated. Returns a new instance with the exact expansion logic, but reversed.

Uses of RelationshipExpander in org.neo4j.graphdb.traversal

Methods in org.neo4j.graphdb.traversal with parameters of type RelationshipExpander

Modifier and Type	Method and Description
TraversalDescription	TraversalDescription.expand(RelationshipExpander expander) Deprecated. Because RelationshipExpander is deprecated