GraphAlgoFactory.See: Description
| Interface | Description |
|---|---|
| CostAccumulator<T> |
In order to make the solving of shortest path problems as general as
possible, the algorithms accept objects handling all relevant tasks regarding
costs of paths.
|
| CostEvaluator<T> |
In order to make the solving of shortest path problems as general as
possible, the algorithms accept objects handling all relevant tasks regarding
costs of paths.
|
| EstimateEvaluator<T> |
Evaluator used to estimate the weight of the remaining path from one node to
another.
|
| MaxCostEvaluator<T> |
Evaluator for determining if the maximum path cost has been exceeded.
|
| PathFinder<P extends Path> |
Interface of algorithms that finds paths in between two nodes.
|
| WeightedPath |
A
Path that has an associated weight. |
| Class | Description |
|---|---|
| CommonEvaluators |
Factory for common evaluators used by some graph algos, f.ex
CostEvaluator and EstimateEvaluator. |
| GraphAlgoFactory |
Static factory methods for the recommended implementations of common
graph algorithms for Neo4j.
|
GraphAlgoFactory.Copyright © 2002–2015 The Neo4j Graph Database Project. All rights reserved.