Package | Description |
---|---|
org.neo4j.cypher.export | |
org.neo4j.graphalgo |
Scalable graph algorithms like shortest path and others for Neo4j which
can be easily accessed via
GraphAlgoFactory . |
org.neo4j.graphdb |
The core graph database API.
|
org.neo4j.graphdb.event |
Event framework.
|
org.neo4j.graphdb.index |
Integrated API for node and relationship indexing.
|
org.neo4j.graphdb.traversal |
Traversal framework.
|
org.neo4j.graphmatching |
Facilities for finding occurrences of patterns in a Neo4j graph.
|
org.neo4j.server.plugins | |
org.neo4j.tooling |
Tools, including global operations over the whole graph.
|
Modifier and Type | Method and Description |
---|---|
Iterable<Node> |
CypherResultSubGraph.getNodes() |
Iterable<Node> |
SubGraph.getNodes() |
Iterable<Node> |
DatabaseSubGraph.getNodes() |
Modifier and Type | Method and Description |
---|---|
void |
CypherResultSubGraph.add(Node node) |
Modifier and Type | Method and Description |
---|---|
Iterable<P> |
PathFinder.findAllPaths(Node start,
Node end)
Tries to find all paths between
start and end nodes. |
P |
PathFinder.findSinglePath(Node start,
Node end)
Tries to find a single path between
start and end
nodes. |
T |
EstimateEvaluator.getCost(Node node,
Node goal)
Estimate the weight of the remaining path from one node to another.
|
Modifier and Type | Method and Description |
---|---|
Node |
GraphDatabaseService.createNode()
Creates a new node.
|
Node |
GraphDatabaseService.createNode(Label... labels)
Creates a new node and adds the provided labels to it.
|
Node |
TraversalPosition.currentNode()
Returns the current node.
|
Node |
Path.endNode()
Returns the end node of this path.
|
Node |
Relationship.getEndNode()
Returns the end node of this relationship.
|
Node |
GraphDatabaseService.getNodeById(long id)
Looks up a node by id.
|
Node[] |
Relationship.getNodes()
Returns the two nodes that are attached to this relationship.
|
Node |
Relationship.getOtherNode(Node node)
A convenience operation that, given a node that is attached to this
relationship, returns the other node.
|
Node |
Relationship.getStartNode()
Returns the start node of this relationship.
|
Node |
TraversalPosition.previousNode()
Returns the previous node.
|
Node |
Path.startNode()
Returns the start node of this path.
|
Modifier and Type | Method and Description |
---|---|
ResourceIterable<Node> |
GraphDatabaseService.findNodesByLabelAndProperty(Label label,
String key,
Object value)
Returns all nodes having the label, and the wanted property value.
|
Iterable<Node> |
GraphDatabaseService.getAllNodes()
Deprecated.
this operation can be found in
GlobalGraphOperations instead. |
Collection<Node> |
Traverser.getAllNodes()
Deprecated.
Returns a collection of all nodes for this traversal.
|
Iterator<Node> |
Traverser.iterator()
Deprecated.
Returns an
Iterator representing the traversal of the graph. |
Iterable<Node> |
Path.nodes()
Returns all the nodes in this path starting from the start node going
forward towards the end node.
|
Iterable<Node> |
Path.reverseNodes()
Returns all the nodes in this path in reversed order, i.e.
|
Modifier and Type | Method and Description |
---|---|
Relationship |
Node.createRelationshipTo(Node otherNode,
RelationshipType type)
Creates a relationship between this node and another node.
|
Iterable<Relationship> |
RelationshipExpander.expand(Node node)
Deprecated.
Returns relationships for a
Node . |
Node |
Relationship.getOtherNode(Node node)
A convenience operation that, given a node that is attached to this
relationship, returns the other node.
|
Modifier and Type | Method and Description |
---|---|
Expander |
Expander.addNodeFilter(Predicate<? super Node> filter)
Deprecated.
Add a
Node filter. |
Modifier and Type | Method and Description |
---|---|
Node |
LabelEntry.node()
This is the node which has had the label added or removed.
|
Modifier and Type | Method and Description |
---|---|
Iterable<PropertyEntry<Node>> |
TransactionData.assignedNodeProperties()
Get the properties that had a value assigned or overwritten on a node
during the transaction.
|
Iterable<Node> |
TransactionData.createdNodes()
Get the nodes that were created during the transaction.
|
Iterable<Node> |
TransactionData.deletedNodes()
Get the nodes that were deleted during the transaction.
|
Iterable<PropertyEntry<Node>> |
TransactionData.removedNodeProperties()
Get the properties that had a value removed from a node during the
transaction.
|
Modifier and Type | Method and Description |
---|---|
boolean |
TransactionData.isDeleted(Node node)
Returns whether or not
node is deleted in this transaction. |
Modifier and Type | Method and Description |
---|---|
Index<Node> |
IndexManager.forNodes(String indexName)
|
Index<Node> |
IndexManager.forNodes(String indexName,
Map<String,String> customConfiguration)
|
AutoIndexer<Node> |
IndexManager.getNodeAutoIndexer() |
Index<Node> |
IndexImplementation.nodeIndex(String indexName,
Map<String,String> config)
|
Modifier and Type | Method and Description |
---|---|
IndexHits<Relationship> |
ReadableRelationshipIndex.get(String key,
Object valueOrNull,
Node startNodeOrNull,
Node endNodeOrNull)
Returns exact matches from this index, given the key/value pair.
|
IndexHits<Relationship> |
ReadableRelationshipIndex.query(Object queryOrQueryObjectOrNull,
Node startNodeOrNull,
Node endNodeOrNull)
Returns matches from this index based on the supplied query object, which
can be a query string or an implementation-specific query object.
|
IndexHits<Relationship> |
ReadableRelationshipIndex.query(String key,
Object queryOrQueryObjectOrNull,
Node startNodeOrNull,
Node endNodeOrNull)
Returns matches from this index based on the supplied
key and
query object, which can be a query string or an implementation-specific
query object. |
Constructor and Description |
---|
UniqueFactory.UniqueNodeFactory(Index<Node> index)
Create a new
UniqueFactory for nodes. |
Modifier and Type | Method and Description |
---|---|
ResourceIterable<Node> |
Traverser.nodes()
Represents the traversal in the form of
Node s. |
Modifier and Type | Method and Description |
---|---|
static PathEvaluator |
Evaluators.endNodeIs(Evaluation evaluationIfMatch,
Evaluation evaluationIfNoMatch,
Node... possibleEndNodes)
An
Evaluator which will return evaluationIfMatch if Path.endNode()
for a given path is any of nodes , else evaluationIfNoMatch . |
static PathEvaluator |
Evaluators.includeIfContainsAll(Node... nodes)
Evaluator which decides to include a
Path if all the
nodes exist in it. |
static PathEvaluator |
Evaluators.includeWhereEndNodeIs(Node... nodes) |
String |
Paths.DefaultPathDescriptor.nodeRepresentation(Path path,
Node node) |
String |
Paths.PathDescriptor.nodeRepresentation(T path,
Node node)
Returns a string representation of a
Node . |
static PathEvaluator |
Evaluators.pruneWhereEndNodeIs(Node... nodes) |
String |
Paths.DefaultPathDescriptor.relationshipRepresentation(Path path,
Node from,
Relationship relationship) |
String |
Paths.PathDescriptor.relationshipRepresentation(T path,
Node from,
Relationship relationship)
Returns a string representation of a
Relationship . |
static Evaluator |
Evaluators.returnWhereEndNodeIs(Node... nodes)
Deprecated.
|
Traverser |
TraversalDescription.traverse(Node... startNodes)
Traverse from a set of start nodes based on all the rules and behavior
in this description.
|
Traverser |
TraversalDescription.traverse(Node startNode)
Traverse from a single start node based on all the rules and behavior
in this description.
|
Traverser |
BidirectionalTraversalDescription.traverse(Node start,
Node end)
Traverse between a given
start and end node with all
applied rules and behavior in this traversal description. |
Modifier and Type | Method and Description |
---|---|
Traverser |
TraversalDescription.traverse(Iterable<Node> iterableStartNodes)
Traverse from a iterable of start nodes based on all the rules and behavior
in this description.
|
Traverser |
BidirectionalTraversalDescription.traverse(Iterable<Node> start,
Iterable<Node> end)
Traverse between a set of
start and end nodes with all
applied rules and behavior in this traversal description. |
Traverser |
BidirectionalTraversalDescription.traverse(Iterable<Node> start,
Iterable<Node> end)
Traverse between a set of
start and end nodes with all
applied rules and behavior in this traversal description. |
Modifier and Type | Method and Description |
---|---|
Node |
PatternElement.getNode()
Deprecated.
Returns the matching
Node which is just one part of the whole
match. |
Node |
PatternMatch.getNodeFor(PatternNode node)
Deprecated.
|
Modifier and Type | Method and Description |
---|---|
Iterable<PatternMatch> |
PatternMatcher.match(PatternNode start,
Node startNode)
Deprecated.
Find occurrences of the pattern defined by the given
PatternNode
where the given PatternNode starts matching at the given
Node . |
Iterable<PatternMatch> |
PatternMatcher.match(PatternNode start,
Node startNode,
Map<String,PatternNode> objectVariables)
Deprecated.
Find occurrences of the pattern defined by the given
PatternNode
where the given PatternNode starts matching at the given
Node . |
Iterable<PatternMatch> |
PatternMatcher.match(PatternNode start,
Node startNode,
Map<String,PatternNode> objectVariables,
Collection<PatternNode> optional)
Deprecated.
Find occurrences of the pattern defined by the given
PatternNode
where the given PatternNode starts matching at the given
Node . |
Iterable<PatternMatch> |
PatternMatcher.match(PatternNode start,
Node startNode,
Map<String,PatternNode> objectVariables,
PatternNode... optional)
Deprecated.
Find occurrences of the pattern defined by the given
PatternNode
where the given PatternNode starts matching at the given
Node . |
Modifier and Type | Method and Description |
---|---|
Node |
ParameterList.getNode(org.neo4j.kernel.GraphDatabaseAPI graphDb,
String name) |
Node[] |
ParameterList.getNodeList(org.neo4j.kernel.GraphDatabaseAPI graphDb,
String name) |
Modifier and Type | Method and Description |
---|---|
Iterable<Node> |
GlobalGraphOperations.getAllNodes()
Returns all nodes in the graph.
|
ResourceIterable<Node> |
GlobalGraphOperations.getAllNodesWithLabel(Label label)
|
Copyright © 2002–2014 The Neo4j Graph Database Project. All rights reserved.