Uses of Interface
org.neo4j.graphalgo.WeightedPath

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

Uses of WeightedPath in org.neo4j.graphalgo
 

Methods in org.neo4j.graphalgo that return types with arguments of type WeightedPath
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(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).
 



Copyright © 2011 The Neo4j Graph Database Project. All Rights Reserved.