Uses of Interface
org.neo4j.graphalgo.WeightedPath

Uses of WeightedPath in org.neo4j.graphalgo

Methods in org.neo4j.graphalgo that return types with arguments of type WeightedPath

Modifier and Type	Method and Description
static PathFinder<WeightedPath>	GraphAlgoFactory.aStar(org.neo4j.graphdb.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(org.neo4j.graphdb.PathExpander 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(org.neo4j.graphdb.PathExpander expander, CostEvaluator<Double> costEvaluator, int numberOfWantedPaths) See GraphAlgoFactory.dijkstra(PathExpander, CostEvaluator) for documentation Instead of finding all shortest paths with equal cost, find the top numberOfWantedPaths paths.
static PathFinder<WeightedPath>	GraphAlgoFactory.dijkstra(org.neo4j.graphdb.PathExpander expander, org.neo4j.graphdb.traversal.InitialBranchState stateFactory, CostEvaluator<Double> costEvaluator) Deprecated. Dijkstra should not be used with state on PathExpander See GraphAlgoFactory.dijkstra(PathExpander, CostEvaluator). See GraphAlgoFactory.dijkstra(PathExpander, CostEvaluator) for documentation. Uses a cost evaluator which uses the supplied property key to represent the cost (values of type double).
static PathFinder<WeightedPath>	GraphAlgoFactory.dijkstra(org.neo4j.graphdb.PathExpander expander, org.neo4j.graphdb.traversal.InitialBranchState stateFactory, String relationshipPropertyRepresentingCost) Deprecated. Dijkstra should not be used with state on PathExpander See GraphAlgoFactory.dijkstra(PathExpander, CostEvaluator). See GraphAlgoFactory.dijkstra(PathExpander, CostEvaluator) for documentation. Uses a cost evaluator which uses the supplied property key to represent the cost (values of type double).
static PathFinder<WeightedPath>	GraphAlgoFactory.dijkstra(org.neo4j.graphdb.PathExpander expander, String relationshipPropertyRepresentingCost) See GraphAlgoFactory.dijkstra(PathExpander, CostEvaluator) for documentation.
static PathFinder<WeightedPath>	GraphAlgoFactory.dijkstra(org.neo4j.graphdb.PathExpander expander, String relationshipPropertyRepresentingCost, int numberOfWantedPaths) See GraphAlgoFactory.dijkstra(PathExpander, CostEvaluator) for documentation Instead of finding all shortest paths with equal cost, find the top numberOfWantedPaths paths.