Overview | Package | Class | Use | Tree | Deprecated | Index | Help

Neo4j Community
PREV NEXT | FRAMES NO FRAMES

## Uses of Interface
org.neo4j.graphalgo.PathFinder

Packages that use PathFinder
org.neo4j.graphalgo | Scalable graph algorithms like shortest path and others for Neo4j which can be easily accessed via `GraphAlgoFactory`.

Uses of PathFinder in org.neo4j.graphalgo

Methods in org.neo4j.graphalgo that return PathFinder
`static PathFinder<Path>` | `GraphAlgoFactory.allPaths(PathExpander expander, int maxDepth)` Returns an algorithm which can find all available paths between two nodes.
`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(PathExpander expander, int maxDepth)` Returns an algorithm which can find all simple 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(PathExpander 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.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(PathExpander 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(PathExpander expander, InitialBranchState stateFactory, CostEvaluator<Double> costEvaluator)` See `GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator)`.
`static PathFinder<WeightedPath>` | `GraphAlgoFactory.dijkstra(PathExpander expander, InitialBranchState stateFactory, String relationshipPropertyRepresentingCost)` See `GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator)`.
`static PathFinder<WeightedPath>` | `GraphAlgoFactory.dijkstra(PathExpander expander, InitialStateFactory stateFactory, CostEvaluator<Double> costEvaluator)` See `GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator)`.
`static PathFinder<WeightedPath>` | `GraphAlgoFactory.dijkstra(PathExpander expander, InitialStateFactory stateFactory, String relationshipPropertyRepresentingCost)` See `GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator)`.
`static PathFinder<WeightedPath>` | `GraphAlgoFactory.dijkstra(PathExpander expander, String relationshipPropertyRepresentingCost)` See `GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator)`.
`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(PathExpander expander, int length)` Returns an algorithm which can find simple all paths of a certain length between two nodes.
`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(PathExpander 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(PathExpander 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)` 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.

Overview | Package | Class | Use | Tree | Deprecated | Index | Help

Neo4j Community
PREV NEXT | FRAMES NO FRAMES

Copyright © 2002-2013 The Neo4j Graph Database Project. All Rights Reserved.