
Neo4j Community  
PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 
java.lang.Object org.neo4j.graphalgo.GraphAlgoFactory
public abstract class GraphAlgoFactory
Static factory methods for the recommended implementations of common graph algorithms for Neo4j. The algorithms exposed here are implementations which are tested extensively and also scale on bigger graphs.
Constructor Summary  

GraphAlgoFactory()

Method Summary  

static PathFinder<Path> 
allPaths(PathExpander expander,
int maxDepth)
Returns an algorithm which can find all available paths between two nodes. 
static PathFinder<Path> 
allPaths(RelationshipExpander expander,
int maxDepth)
Returns an algorithm which can find all available paths between two nodes. 
static PathFinder<Path> 
allSimplePaths(PathExpander expander,
int maxDepth)
Returns an algorithm which can find all simple paths between two nodes. 
static PathFinder<Path> 
allSimplePaths(RelationshipExpander expander,
int maxDepth)
Returns an algorithm which can find all simple paths between two nodes. 
static PathFinder<WeightedPath> 
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> 
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> 
dijkstra(PathExpander expander,
CostEvaluator<Double> costEvaluator)
Returns an PathFinder which uses the Dijkstra algorithm to find
the cheapest path between two nodes. 
static PathFinder<WeightedPath> 
dijkstra(PathExpander expander,
InitialStateFactory stateFactory,
CostEvaluator<Double> costEvaluator)
See dijkstra(RelationshipExpander, CostEvaluator) . 
static PathFinder<WeightedPath> 
dijkstra(PathExpander expander,
InitialStateFactory stateFactory,
String relationshipPropertyRepresentingCost)
See dijkstra(RelationshipExpander, CostEvaluator) . 
static PathFinder<WeightedPath> 
dijkstra(PathExpander expander,
String relationshipPropertyRepresentingCost)
See dijkstra(RelationshipExpander, CostEvaluator) . 
static PathFinder<WeightedPath> 
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> 
dijkstra(RelationshipExpander expander,
String relationshipPropertyRepresentingCost)
See dijkstra(RelationshipExpander, CostEvaluator) . 
static PathFinder<Path> 
pathsWithLength(PathExpander expander,
int length)
Returns an algorithm which can find simple all paths of a certain length between two nodes. 
static PathFinder<Path> 
pathsWithLength(RelationshipExpander expander,
int length)
Returns an algorithm which can find simple all paths of a certain length between two nodes. 
static PathFinder<Path> 
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> 
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> 
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> 
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. 
Methods inherited from class java.lang.Object 

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait 
Constructor Detail 

public GraphAlgoFactory()
Method Detail 

public static PathFinder<Path> allPaths(RelationshipExpander expander, int maxDepth)
expander
 the RelationshipExpander
to use for expanding
Relationship
s for each Node
.maxDepth
 the max Path.length()
returned paths are
allowed to have.
AllPaths
public static PathFinder<Path> allPaths(PathExpander expander, int maxDepth)
expander
 the PathExpander
to use for expanding
Relationship
s for each Path
.maxDepth
 the max Path.length()
returned paths are
allowed to have.
AllPaths
public static PathFinder<Path> allSimplePaths(RelationshipExpander expander, int maxDepth)
expander
 the RelationshipExpander
to use for expanding
Relationship
s for each Node
.maxDepth
 the max Path.length()
returned paths are
allowed to have.
AllSimplePaths
public static PathFinder<Path> allSimplePaths(PathExpander expander, int maxDepth)
expander
 the PathExpander
to use for expanding
Relationship
s for each Path
.maxDepth
 the max Path.length()
returned paths are
allowed to have.
AllSimplePaths
public static PathFinder<Path> shortestPath(RelationshipExpander expander, int maxDepth)
Path.length()
as possible) between two nodes. These
returned paths cannot contain loops (i.e. a node cannot occur more than
once in any returned path).
expander
 the RelationshipExpander
to use for expanding
Relationship
s for each Node
.maxDepth
 the max Path.length()
returned paths are allowed
to have.
ShortestPath
public static PathFinder<Path> shortestPath(PathExpander expander, int maxDepth)
Path.length()
as possible) between two nodes. These
returned paths cannot contain loops (i.e. a node cannot occur more than
once in any returned path).
expander
 the PathExpander
to use for expanding
Relationship
s for each Path
.maxDepth
 the max Path.length()
returned paths are allowed
to have.
ShortestPath
public static PathFinder<Path> shortestPath(RelationshipExpander expander, int maxDepth, int maxHitCount)
Path.length()
as possible) between two nodes. These
returned paths cannot contain loops (i.e. a node cannot occur more than
once in any returned path).
expander
 the RelationshipExpander
to use for expanding
Relationship
s for each Node
.maxDepth
 the max Path.length()
returned paths are allowed
to have.maxResultCount
 the maximum number of Path
s to return.
If this number of found paths are encountered the traversal will stop.
ShortestPath
public static PathFinder<Path> shortestPath(PathExpander expander, int maxDepth, int maxHitCount)
Path.length()
as possible) between two nodes. These
returned paths cannot contain loops (i.e. a node cannot occur more than
once in any returned path).
expander
 the PathExpander
to use for expanding
Relationship
s for each Path
.maxDepth
 the max Path.length()
returned paths are allowed
to have.maxResultCount
 the maximum number of Path
s to return.
If this number of found paths are encountered the traversal will stop.
ShortestPath
public static PathFinder<Path> pathsWithLength(RelationshipExpander expander, int length)
expander
 the RelationshipExpander
to use for expanding
Relationship
s for each Node
.length
 the Path.length()
returned paths will have, if any
paths were found.
ShortestPath
public static PathFinder<Path> pathsWithLength(PathExpander expander, int length)
expander
 the PathExpander
to use for expanding
Relationship
s for each Node
.length
 the Path.length()
returned paths will have, if any
paths were found.
ShortestPath
public static PathFinder<WeightedPath> aStar(RelationshipExpander expander, CostEvaluator<Double> lengthEvaluator, EstimateEvaluator<Double> estimateEvaluator)
PathFinder
which uses the A* algorithm to find the
cheapest path between two nodes. The definition of "cheap" is the lowest
possible cost to get from the start node to the end node, where the cost
is returned from lengthEvaluator
and estimateEvaluator
.
These returned paths cannot contain loops (i.e. a node cannot occur more
than once in any returned path).
See http://en.wikipedia.org/wiki/A*_search_algorithm for more
information.
expander
 the RelationshipExpander
to use for expanding
Relationship
s for each Node
.lengthEvaluator
 evaluator that can return the cost represented
by each relationship the algorithm traverses.estimateEvaluator
 evaluator that returns an (optimistic)
estimation of the cost to get from the current node (in the traversal)
to the end node.
AStar
public static PathFinder<WeightedPath> aStar(PathExpander expander, CostEvaluator<Double> lengthEvaluator, EstimateEvaluator<Double> estimateEvaluator)
PathFinder
which uses the A* algorithm to find the
cheapest path between two nodes. The definition of "cheap" is the lowest
possible cost to get from the start node to the end node, where the cost
is returned from lengthEvaluator
and estimateEvaluator
.
These returned paths cannot contain loops (i.e. a node cannot occur more
than once in any returned path).
See http://en.wikipedia.org/wiki/A*_search_algorithm for more
information.
expander
 the PathExpander
to use for expanding
Relationship
s for each Path
.lengthEvaluator
 evaluator that can return the cost represented
by each relationship the algorithm traverses.estimateEvaluator
 evaluator that returns an (optimistic)
estimation of the cost to get from the current node (in the traversal)
to the end node.
AStar
public static PathFinder<WeightedPath> dijkstra(RelationshipExpander expander, CostEvaluator<Double> costEvaluator)
PathFinder
which uses the Dijkstra algorithm to find
the cheapest path between two nodes. The definition of "cheap" is the
lowest possible cost to get from the start node to the end node, where
the cost is returned from costEvaluator
. These returned paths
cannot contain loops (i.e. a node cannot occur more than once in any
returned path).
See http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm for more
information.
expander
 the RelationshipExpander
to use for expanding
Relationship
s for each Node
.costEvaluator
 evaluator that can return the cost represented
by each relationship the algorithm traverses.
Dijkstra
public static PathFinder<WeightedPath> dijkstra(PathExpander expander, CostEvaluator<Double> costEvaluator)
PathFinder
which uses the Dijkstra algorithm to find
the cheapest path between two nodes. The definition of "cheap" is the
lowest possible cost to get from the start node to the end node, where
the cost is returned from costEvaluator
. These returned paths
cannot contain loops (i.e. a node cannot occur more than once in any
returned path).
See http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm for more
information.
expander
 the PathExpander
to use for expanding
Relationship
s for each Path
.costEvaluator
 evaluator that can return the cost represented
by each relationship the algorithm traverses.
Dijkstra
public static PathFinder<WeightedPath> dijkstra(RelationshipExpander expander, String relationshipPropertyRepresentingCost)
dijkstra(RelationshipExpander, CostEvaluator)
.
Uses a cost evaluator which uses the supplied property key to
represent the cost (values of type
expander
 the RelationshipExpander
to use for expanding
Relationship
s for each Node
.relationshipPropertyRepresentingCost
 the property to represent cost
on each relationship the algorithm traverses.
public static PathFinder<WeightedPath> dijkstra(PathExpander expander, String relationshipPropertyRepresentingCost)
dijkstra(RelationshipExpander, CostEvaluator)
.
Uses a cost evaluator which uses the supplied property key to
represent the cost (values of type
expander
 the PathExpander
to use for expanding
Relationship
s for each Path
.relationshipPropertyRepresentingCost
 the property to represent cost
on each relationship the algorithm traverses.
public static PathFinder<WeightedPath> dijkstra(PathExpander expander, InitialStateFactory stateFactory, CostEvaluator<Double> costEvaluator)
dijkstra(RelationshipExpander, CostEvaluator)
.
Uses a cost evaluator which uses the supplied property key to
represent the cost (values of type
expander
 the PathExpander
to use for expanding
Relationship
s for each Path
.stateFactory
 initial state for the traversal branches.relationshipPropertyRepresentingCost
 the property to represent cost
on each relationship the algorithm traverses.
public static PathFinder<WeightedPath> dijkstra(PathExpander expander, InitialStateFactory stateFactory, String relationshipPropertyRepresentingCost)
dijkstra(RelationshipExpander, CostEvaluator)
.
Uses a cost evaluator which uses the supplied property key to
represent the cost (values of type
expander
 the PathExpander
to use for expanding
Relationship
s for each Path
.stateFactory
 initial state for the traversal branches.relationshipPropertyRepresentingCost
 the property to represent cost
on each relationship the algorithm traverses.

Neo4j Community  
PREV CLASS NEXT CLASS  FRAMES NO FRAMES  
SUMMARY: NESTED  FIELD  CONSTR  METHOD  DETAIL: FIELD  CONSTR  METHOD 