A C D E F G I M O P S W

A

addCosts(T, T) - Method in interface org.neo4j.graphalgo.CostAccumulator

This is the accumulating method.

allPaths(PathExpander, int) - Static method in class org.neo4j.graphalgo.GraphAlgoFactory

Returns an algorithm which can find all available paths between two nodes.

allSimplePaths(PathExpander, int) - Static method in class org.neo4j.graphalgo.GraphAlgoFactory

Returns an algorithm which can find all simple paths between two nodes.

aStar(PathExpander, CostEvaluator<Double>, EstimateEvaluator<Double>) - Static method in class org.neo4j.graphalgo.GraphAlgoFactory

Returns an PathFinder which uses the A* algorithm to find the cheapest path between two nodes.

C

CommonEvaluators - Class in org.neo4j.graphalgo

Factory for common evaluators used by some graph algos, f.ex CostEvaluator and EstimateEvaluator.

CommonEvaluators() - Constructor for class org.neo4j.graphalgo.CommonEvaluators

CostAccumulator<T> - Interface in org.neo4j.graphalgo

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> - Interface in org.neo4j.graphalgo

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.

D

dijkstra(PathExpander, CostEvaluator<Double>) - Static method in class org.neo4j.graphalgo.GraphAlgoFactory

Returns a PathFinder which uses the Dijkstra algorithm to find the cheapest path between two nodes.

dijkstra(PathExpander, String) - Static method in class org.neo4j.graphalgo.GraphAlgoFactory

See dijkstra(PathExpander, CostEvaluator) for documentation.

dijkstra(PathExpander, String, int) - Static method in class org.neo4j.graphalgo.GraphAlgoFactory

See dijkstra(PathExpander, CostEvaluator) for documentation Instead of finding all shortest paths with equal cost, find the top numberOfWantedPaths paths.

dijkstra(PathExpander, CostEvaluator<Double>, int) - Static method in class org.neo4j.graphalgo.GraphAlgoFactory

See dijkstra(PathExpander, CostEvaluator) for documentation Instead of finding all shortest paths with equal cost, find the top numberOfWantedPaths paths.

dijkstra(PathExpander, InitialBranchState, CostEvaluator<Double>) - Static method in class org.neo4j.graphalgo.GraphAlgoFactory

Deprecated.

Dijkstra should not be used with state on PathExpander See dijkstra(PathExpander, CostEvaluator). See dijkstra(PathExpander, CostEvaluator) for documentation. Uses a cost evaluator which uses the supplied property key to represent the cost (values of type double).

dijkstra(PathExpander, InitialBranchState, String) - Static method in class org.neo4j.graphalgo.GraphAlgoFactory

Deprecated.

Dijkstra should not be used with state on PathExpander See dijkstra(PathExpander, CostEvaluator). See dijkstra(PathExpander, CostEvaluator) for documentation. Uses a cost evaluator which uses the supplied property key to represent the cost (values of type double).

doubleCostEvaluator(String) - Static method in class org.neo4j.graphalgo.CommonEvaluators

doubleCostEvaluator(String, double) - Static method in class org.neo4j.graphalgo.CommonEvaluators

E

EstimateEvaluator<T> - Interface in org.neo4j.graphalgo

Evaluator used to estimate the weight of the remaining path from one node to another.

F

findAllPaths(Node, Node) - Method in interface org.neo4j.graphalgo.PathFinder

Tries to find all paths between start and end nodes.

findSinglePath(Node, Node) - Method in interface org.neo4j.graphalgo.PathFinder

Tries to find a single path between start and end nodes.

G

geoEstimateEvaluator(String, String) - Static method in class org.neo4j.graphalgo.CommonEvaluators

getCost(Relationship, Direction) - Method in interface org.neo4j.graphalgo.CostEvaluator

This is the general method for looking up costs for relationships.

getCost(Node, Node) - Method in interface org.neo4j.graphalgo.EstimateEvaluator

Estimate the weight of the remaining path from one node to another.

GraphAlgoFactory - Class in org.neo4j.graphalgo

Static factory methods for the recommended implementations of common graph algorithms for Neo4j.

GraphAlgoFactory() - Constructor for class org.neo4j.graphalgo.GraphAlgoFactory

I

intCostEvaluator(String) - Static method in class org.neo4j.graphalgo.CommonEvaluators

M

MaxCostEvaluator<T> - Interface in org.neo4j.graphalgo

Evaluator for determining if the maximum path cost has been exceeded.

maxCostExceeded(T) - Method in interface org.neo4j.graphalgo.MaxCostEvaluator

Evaluates whether the maximum cost has been exceeded.

metadata() - Method in interface org.neo4j.graphalgo.PathFinder

O

org.neo4j.graphalgo - package org.neo4j.graphalgo

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

P

PathFinder<P extends org.neo4j.graphdb.Path> - Interface in org.neo4j.graphalgo

Interface of algorithms that finds paths in between two nodes.

pathsWithLength(PathExpander, int) - Static method in class org.neo4j.graphalgo.GraphAlgoFactory

Returns an algorithm which can find simple all paths of a certain length between two nodes.

S

shortestPath(PathExpander, int) - Static method in class org.neo4j.graphalgo.GraphAlgoFactory

Returns an algorithm which can find all shortest paths (that is paths with as short Path.length() as possible) between two nodes.

shortestPath(PathExpander, int, int) - Static method in class org.neo4j.graphalgo.GraphAlgoFactory

Returns an algorithm which can find all shortest paths (that is paths with as short Path.length() as possible) between two nodes.

W

weight() - Method in interface org.neo4j.graphalgo.WeightedPath

Returns the weight of the path.

WeightedPath - Interface in org.neo4j.graphalgo

A Path that has an associated weight.

A C D E F G I M O P S W