Package | Description |
---|---|
org.neo4j.graphalgo |
Scalable graph algorithms like shortest path and others for Neo4j which
can be easily accessed via
GraphAlgoFactory . |
org.neo4j.graphdb.traversal |
Traversal framework.
|
Modifier and Type | Method and Description |
---|---|
static PathFinder<WeightedPath> |
GraphAlgoFactory.dijkstra(PathExpander expander,
InitialBranchState stateFactory,
CostEvaluator<Double> costEvaluator)
|
static PathFinder<WeightedPath> |
GraphAlgoFactory.dijkstra(PathExpander expander,
InitialBranchState stateFactory,
String relationshipPropertyRepresentingCost)
|
Modifier and Type | Class and Description |
---|---|
static class |
InitialBranchState.Adapter<STATE> |
static class |
InitialBranchState.State<STATE>
Branch state evaluator for an initial state.
|
static class |
InitialStateFactory.AsInitialBranchState<STATE>
Deprecated.
Wraps an
InitialStateFactory in a InitialBranchState |
Modifier and Type | Field and Description |
---|---|
static InitialBranchState |
InitialBranchState.NO_STATE |
Modifier and Type | Method and Description |
---|---|
InitialBranchState<STATE> |
InitialBranchState.reverse()
Creates a version of this state factory which produces reversed initial state,
used in bidirectional traversals.
|
InitialBranchState<STATE> |
InitialBranchState.Adapter.reverse() |
InitialBranchState<STATE> |
InitialBranchState.State.reverse() |
InitialBranchState<STATE> |
InitialStateFactory.AsInitialBranchState.reverse() |
Modifier and Type | Method and Description |
---|---|
<STATE> TraversalDescription |
TraversalDescription.expand(PathExpander<STATE> expander,
InitialBranchState<STATE> initialState)
Sets the
PathExpander as the expander of relationships,
discarding all previous calls to
TraversalDescription.relationships(RelationshipType) and
TraversalDescription.relationships(RelationshipType, Direction) or any other expand method. |
Copyright © 2002–2015 The Neo4j Graph Database Project. All rights reserved.