org.neo4j.graphalgo (Neo4j Community 2.1.0-M01 API)
Date: 2014-02-20

# Package org.neo4j.graphalgo

Scalable graph algorithms like shortest path and others for Neo4j which can be easily accessed via `GraphAlgoFactory`.

See: Description

- Interface Summary
  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 Summary
  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.

## Package org.neo4j.graphalgo Description

Scalable graph algorithms like shortest path and others for Neo4j which can be easily accessed via `GraphAlgoFactory`.

Copyright © 2002–2014 The Neo4j Graph Database Project. All rights reserved.