Uses of Interface
org.neo4j.graphalgo.CostEvaluator

Packages that use CostEvaluator

Package	Description
org.neo4j.graphalgo	Scalable graph algorithms like shortest path and others for Neo4j which can be easily accessed via GraphAlgoFactory.

Uses of CostEvaluator in org.neo4j.graphalgo

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

Modifier and Type	Method	Description
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, 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, 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.