Package | Description |
---|---|
org.neo4j.graphalgo |
Scalable graph algorithms like shortest path and others for Neo4j which
can be easily accessed via
GraphAlgoFactory . |
Modifier and Type | Method and Description |
---|---|
static PathFinder<Path> |
GraphAlgoFactory.allPaths(PathExpander expander,
int maxDepth)
Returns an algorithm which can find all available paths between two
nodes.
|
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(PathExpander expander,
int maxDepth)
Returns an algorithm which can find all simple 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(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(RelationshipExpander expander,
CostEvaluator<Double> lengthEvaluator,
EstimateEvaluator<Double> estimateEvaluator)
Returns a
PathFinder which uses the A* algorithm to find the
cheapest path between two nodes. |
static PathFinder<WeightedPath> |
GraphAlgoFactory.dijkstra(PathExpander expander,
CostEvaluator<Double> costEvaluator)
Returns a
PathFinder which uses the Dijkstra algorithm to find
the cheapest path between two nodes. |
static PathFinder<WeightedPath> |
GraphAlgoFactory.dijkstra(PathExpander expander,
InitialBranchState stateFactory,
CostEvaluator<Double> costEvaluator)
|
static PathFinder<WeightedPath> |
GraphAlgoFactory.dijkstra(PathExpander expander,
InitialBranchState stateFactory,
String relationshipPropertyRepresentingCost)
|
static PathFinder<WeightedPath> |
GraphAlgoFactory.dijkstra(PathExpander expander,
InitialStateFactory stateFactory,
CostEvaluator<Double> costEvaluator)
|
static PathFinder<WeightedPath> |
GraphAlgoFactory.dijkstra(PathExpander expander,
InitialStateFactory stateFactory,
String relationshipPropertyRepresentingCost)
|
static PathFinder<WeightedPath> |
GraphAlgoFactory.dijkstra(PathExpander expander,
String relationshipPropertyRepresentingCost)
|
static PathFinder<WeightedPath> |
GraphAlgoFactory.dijkstra(RelationshipExpander expander,
CostEvaluator<Double> costEvaluator)
Returns a
PathFinder which uses the Dijkstra algorithm to find
the cheapest path between two nodes. |
static PathFinder<WeightedPath> |
GraphAlgoFactory.dijkstra(RelationshipExpander expander,
String relationshipPropertyRepresentingCost)
|
static PathFinder<Path> |
GraphAlgoFactory.pathsWithLength(PathExpander expander,
int length)
Returns an algorithm which can find simple all paths of a certain length
between two nodes.
|
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(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<Path> |
GraphAlgoFactory.shortestPath(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<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. |
Copyright © 2002–2014 The Neo4j Graph Database Project. All rights reserved.