Uses of Interface
org.neo4j.graphalgo.PathFinder

Packages that use PathFinder

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

Uses of PathFinder in org.neo4j.graphalgo

Methods in org.neo4j.graphalgo that return PathFinder

static PathFinder<Path>	GraphAlgoFactory.allPaths(RelationshipExpander expander, int maxDepth) Returns an algorithm which can find all available paths between two nodes.
static PathFinder<Path>	GraphAlgoFactory.allSimplePaths(RelationshipExpander expander, int maxDepth) Returns an algorithm which can find all simple paths 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(RelationshipExpander 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(RelationshipExpander expander, String relationshipPropertyRepresentingCost) See GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator).
static PathFinder<Path>	GraphAlgoFactory.pathsWithLength(RelationshipExpander expander, int length) Returns an algorithm which can find simple all paths of a certain length between two nodes.
static PathFinder<Path>	GraphAlgoFactory.shortestPath(RelationshipExpander expander, int maxDepth) Returns an algorithm which can find all shortest paths (that is paths with as short Path.length() as possible) between two nodes.
static PathFinder<Path>	GraphAlgoFactory.shortestPath(RelationshipExpander expander, int maxDepth, int maxHitCount) Returns an algorithm which can find all shortest paths (that is paths with as short Path.length() as possible) between two nodes.

Uses of PathFinder in org.neo4j.graphalgo.impl.path

Classes in org.neo4j.graphalgo.impl.path that implement PathFinder

class	AllPaths
class	AllSimplePaths
class	AStar
class	Dijkstra
class	ExactDepthPathFinder Tries to find paths in a graph from a start node to an end node where the length of found paths must be of a certain length.
class	ExperimentalAStar
class	ShortestPath Find (all or one) simple shortest path(s) between two nodes.