Uses of Interface
org.neo4j.graphalgo.PathFinder

Uses of PathFinder in org.neo4j.graphalgo

Methods in org.neo4j.graphalgo that return PathFinder

static PathFinder<org.neo4j.graphdb.Path>	GraphAlgoFactory.allPaths(org.neo4j.graphdb.PathExpander expander, int maxDepth) Returns an algorithm which can find all available paths between two nodes.
static PathFinder<org.neo4j.graphdb.Path>	GraphAlgoFactory.allPaths(org.neo4j.graphdb.RelationshipExpander expander, int maxDepth) Returns an algorithm which can find all available paths between two nodes.
static PathFinder<org.neo4j.graphdb.Path>	GraphAlgoFactory.allSimplePaths(org.neo4j.graphdb.PathExpander expander, int maxDepth) Returns an algorithm which can find all simple paths between two nodes.
static PathFinder<org.neo4j.graphdb.Path>	GraphAlgoFactory.allSimplePaths(org.neo4j.graphdb.RelationshipExpander expander, int maxDepth) Returns an algorithm which can find all simple paths between two nodes.
static PathFinder<WeightedPath>	GraphAlgoFactory.aStar(org.neo4j.graphdb.PathExpander 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.aStar(org.neo4j.graphdb.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(org.neo4j.graphdb.PathExpander 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(org.neo4j.graphdb.PathExpander expander, org.neo4j.graphdb.traversal.InitialBranchState stateFactory, CostEvaluator<Double> costEvaluator) See GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator).
static PathFinder<WeightedPath>	GraphAlgoFactory.dijkstra(org.neo4j.graphdb.PathExpander expander, org.neo4j.graphdb.traversal.InitialBranchState stateFactory, String relationshipPropertyRepresentingCost) See GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator).
static PathFinder<WeightedPath>	GraphAlgoFactory.dijkstra(org.neo4j.graphdb.PathExpander expander, org.neo4j.graphdb.traversal.InitialStateFactory stateFactory, CostEvaluator<Double> costEvaluator) See GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator).
static PathFinder<WeightedPath>	GraphAlgoFactory.dijkstra(org.neo4j.graphdb.PathExpander expander, org.neo4j.graphdb.traversal.InitialStateFactory stateFactory, String relationshipPropertyRepresentingCost) See GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator).
static PathFinder<WeightedPath>	GraphAlgoFactory.dijkstra(org.neo4j.graphdb.PathExpander expander, String relationshipPropertyRepresentingCost) See GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator).
static PathFinder<WeightedPath>	GraphAlgoFactory.dijkstra(org.neo4j.graphdb.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(org.neo4j.graphdb.RelationshipExpander expander, String relationshipPropertyRepresentingCost) See GraphAlgoFactory.dijkstra(RelationshipExpander, CostEvaluator).
static PathFinder<org.neo4j.graphdb.Path>	GraphAlgoFactory.pathsWithLength(org.neo4j.graphdb.PathExpander expander, int length) Returns an algorithm which can find simple all paths of a certain length between two nodes.
static PathFinder<org.neo4j.graphdb.Path>	GraphAlgoFactory.pathsWithLength(org.neo4j.graphdb.RelationshipExpander expander, int length) Returns an algorithm which can find simple all paths of a certain length between two nodes.
static PathFinder<org.neo4j.graphdb.Path>	GraphAlgoFactory.shortestPath(org.neo4j.graphdb.PathExpander 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<org.neo4j.graphdb.Path>	GraphAlgoFactory.shortestPath(org.neo4j.graphdb.PathExpander 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.
static PathFinder<org.neo4j.graphdb.Path>	GraphAlgoFactory.shortestPath(org.neo4j.graphdb.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<org.neo4j.graphdb.Path>	GraphAlgoFactory.shortestPath(org.neo4j.graphdb.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.