Overview | Package | Class | Use | Tree | Deprecated | Index | Help
| Neo4j Community
PREV NEXT | FRAMES NO FRAMES

## Uses of Interface
org.neo4j.graphdb.RelationshipExpander

Packages that use RelationshipExpander
org.neo4j.graphalgo | Scalable graph algorithms like shortest path and others for Neo4j which can be easily accessed via `GraphAlgoFactory`.
org.neo4j.graphdb | The graph database API used by Neo4j.
org.neo4j.graphdb.traversal | Traversal framework.
org.neo4j.kernel | Implementation for embedding a Neo4j graph database in an application.

Uses of RelationshipExpander in org.neo4j.graphalgo

Methods in org.neo4j.graphalgo with parameters of type RelationshipExpander
`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 an `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 an `PathFinder` which uses the Dijkstra algorithm to find the cheapest path between two nodes.
`static PathFinder<WeightedPath>` | `GraphAlgoFactory.dijkstra(RelationshipExpander expander, String relationshipPropertyRepresentingCost)` See `GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator)`.
`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.

Uses of RelationshipExpander in org.neo4j.graphdb

Subinterfaces of RelationshipExpander in org.neo4j.graphdb
`interface` | `Expander` This interface is an extension of the `RelationshipExpander` interface that makes it possible to build customized versions of an `Expander`.

Methods in org.neo4j.graphdb that return RelationshipExpander
`RelationshipExpander` | `RelationshipExpander.reversed()` Returns a new instance with the exact same `RelationshipType`s, but with all directions reversed (see `Direction.reverse()`).

Uses of RelationshipExpander in org.neo4j.graphdb.traversal

Methods in org.neo4j.graphdb.traversal with parameters of type RelationshipExpander
`TraversalDescription` | `TraversalDescription.expand(RelationshipExpander expander)` Sets the `RelationshipExpander` as the expander of relationships, discarding all previous calls to `TraversalDescription.relationships(RelationshipType)` and `TraversalDescription.relationships(RelationshipType, Direction)`.

Uses of RelationshipExpander in org.neo4j.kernel

Classes in org.neo4j.kernel that implement RelationshipExpander
`class` | `OrderedByTypeExpander`
`class` | `StandardExpander`

Methods in org.neo4j.kernel with parameters of type RelationshipExpander
`static Expander` | `Traversal.expander(RelationshipExpander expander)` Returns a `RelationshipExpander` wrapped as an `Expander`.

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
| Neo4j Community
PREV NEXT | FRAMES NO FRAMES

Copyright © 2011 The Neo4j Graph Database Project. All Rights Reserved.