Uses of Interface
org.neo4j.graphalgo.WeightedPath
Package
Description
Scalable graph algorithms like shortest path and others for Neo4j which
can be easily accessed via
GraphAlgoFactory
.-
Uses of WeightedPath in org.neo4j.graphalgo
Modifier and TypeMethodDescriptionstatic PathFinder<WeightedPath>
GraphAlgoFactory.aStar
(EvaluationContext context, PathExpander expander, CostEvaluator<Double> lengthEvaluator, EstimateEvaluator<Double> estimateEvaluator) Returns anPathFinder
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) SeeGraphAlgoFactory.dijkstra(EvaluationContext, PathExpander, CostEvaluator)
for documentation.static PathFinder<WeightedPath>
GraphAlgoFactory.dijkstra
(EvaluationContext context, PathExpander<Double> expander, CostEvaluator<Double> costEvaluator) Returns aPathFinder
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) SeeGraphAlgoFactory.dijkstra(EvaluationContext, PathExpander, CostEvaluator)
for documentation Instead of finding all shortest paths with equal cost, find the topnumberOfWantedPaths
paths.static PathFinder<WeightedPath>
GraphAlgoFactory.dijkstra
(PathExpander<Double> expander, CostEvaluator<Double> costEvaluator, int numberOfWantedPaths) SeeGraphAlgoFactory.dijkstra(EvaluationContext, PathExpander, CostEvaluator)
for documentation Instead of finding all shortest paths with equal cost, find the topnumberOfWantedPaths
paths.