Uses of Interface
org.neo4j.graphalgo.PathFinder

Packages that use PathFinder

Package	Description
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

Modifier and Type	Method	Description
static PathFinder<Path>	GraphAlgoFactory.allPaths(EvaluationContext context, PathExpander expander, int maxDepth)	Returns an algorithm which can find all available paths between two nodes.
static PathFinder<Path>	GraphAlgoFactory.allSimplePaths(EvaluationContext context, PathExpander expander, int maxDepth)	Returns an algorithm which can find all simple paths between two nodes.
static PathFinder<WeightedPath>	GraphAlgoFactory.aStar(EvaluationContext context, 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.dijkstra(EvaluationContext context, PathExpander<Double> expander, String relationshipPropertyRepresentingCost)	See GraphAlgoFactory.dijkstra(EvaluationContext, PathExpander, CostEvaluator) for documentation.
static PathFinder<WeightedPath>	GraphAlgoFactory.dijkstra(EvaluationContext context, PathExpander<Double> 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(PathExpander<Double> expander, String relationshipPropertyRepresentingCost, int numberOfWantedPaths)	See GraphAlgoFactory.dijkstra(EvaluationContext, PathExpander, CostEvaluator) for documentation Instead of finding all shortest paths with equal cost, find the top numberOfWantedPaths paths.
static PathFinder<WeightedPath>	GraphAlgoFactory.dijkstra(PathExpander<Double> expander, CostEvaluator<Double> costEvaluator, int numberOfWantedPaths)	See GraphAlgoFactory.dijkstra(EvaluationContext, PathExpander, CostEvaluator) for documentation Instead of finding all shortest paths with equal cost, find the top numberOfWantedPaths paths.
static PathFinder<Path>	GraphAlgoFactory.pathsWithLength(EvaluationContext context, PathExpander expander, int length)	Returns an algorithm which can find simple all paths of a certain length between two nodes.
static PathFinder<Path>	GraphAlgoFactory.shortestPath(EvaluationContext context, 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(EvaluationContext context, 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.