|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
| Uses of PathFinder in org.neo4j.graphalgo |
|---|
| Methods in org.neo4j.graphalgo that return PathFinder | |
|---|---|
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. |
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||