Uses of Interface org.neo4j.graphalgo.CostEvaluator (Neo4j Community 1.8.RC1 API)
Date: 2012-09-07

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
| Neo4j Community
PREV NEXT | FRAMES NO FRAMES

## Uses of Interface
org.neo4j.graphalgo.CostEvaluator

Packages that use CostEvaluator
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 that return CostEvaluator
`static CostEvaluator<Double>` | `CommonEvaluators.doubleCostEvaluator(String relationshipCostPropertyKey)`
`static CostEvaluator<Double>` | `CommonEvaluators.doubleCostEvaluator(String relationshipCostPropertyKey, double defaultCost)`
`static CostEvaluator<Integer>` | `CommonEvaluators.intCostEvaluator(String relationshipCostPropertyKey)`

Methods in org.neo4j.graphalgo with parameters of type CostEvaluator
`static PathFinder<WeightedPath>` | `GraphAlgoFactory.aStar(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.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(PathExpander 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(PathExpander expander, InitialStateFactory stateFactory, CostEvaluator<Double> costEvaluator)` See `GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator)`.
`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.

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
| Neo4j Community
PREV NEXT | FRAMES NO FRAMES

Copyright © 2002-2012 The Neo4j Graph Database Project. All Rights Reserved.