Package org.neo4j.graphalgo

package org.neo4j.graphalgo
Scalable graph algorithms like shortest path and others for Neo4j which can be easily accessed via GraphAlgoFactory.
  • Class
    Description
    BasicEvaluationContext
     
    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.
    EvaluationContext
     
    GraphAlgoFactory
    Static factory methods for the recommended implementations of common graph algorithms for Neo4j.
    PathFinder<P extends Path>
    Interface of algorithms that finds paths in between two nodes.
    WeightedPath
    A Path that has an associated weight.