Uses of Interface
org.neo4j.graphdb.Relationship

Packages that use Relationship

org.neo4j.graphalgo	Scalable graph algorithms like shortest path and others for Neo4j which can be easily accessed via GraphAlgoFactory.
org.neo4j.graphalgo.impl.centrality	Centrality graph algorithms which are allright to use, but doesn't scale to bigger graphs.
org.neo4j.graphalgo.impl.shortestpath	Package containing older implementations of Dijkstra and shortest path, where the ones in GraphAlgoFactory would be a better option.
org.neo4j.graphalgo.impl.util
org.neo4j.graphdb	The graph database API used by Neo4j.
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.kernel	Implementation for embedding a Neo4j graph database in an application.
org.neo4j.kernel.ha
org.neo4j.kernel.impl.core
org.neo4j.kernel.impl.traversal
org.neo4j.tooling.wrap

Uses of Relationship in org.neo4j.graphalgo

Methods in org.neo4j.graphalgo with parameters of type Relationship

T	CostEvaluator.getCost(Relationship relationship, Direction direction) This is the general method for looking up costs for relationships.

Uses of Relationship in org.neo4j.graphalgo.impl.centrality

Fields in org.neo4j.graphalgo.impl.centrality with type parameters of type Relationship

protected Set<Relationship>	EigenvectorCentralityArnoldi.relationshipSet
protected Set<Relationship>	EigenvectorCentralityPower.relationshipSet

Methods in org.neo4j.graphalgo.impl.centrality with parameters of type Relationship

protected void	EigenvectorCentralityArnoldi.processRelationship(Map<Node,Double> newValues, Relationship relationship, boolean backwards) Internal method used in the "matrix multiplication" in each iteration.
protected void	EigenvectorCentralityPower.processRelationship(Map<Node,Double> newValues, Relationship relationship, boolean backwards) Internal method used in the "matrix multiplication" in each iteration.

Method parameters in org.neo4j.graphalgo.impl.centrality with type arguments of type Relationship

protected Double	BetweennessCentrality.getAndUpdateNodeDependency(Node node, boolean skipFirstNode, Map<Node,List<Relationship>> successors, Util.PathCounter counter, Map<Node,Double> dependencies) This recursively updates the node dependencies
protected Double	StressCentrality.getAndUpdateNodeStress(Node node, boolean skipFirstNode, Map<Node,List<Relationship>> successors, Util.PathCounter counter, Map<Node,Double> stresses) This recursively updates the node stress (number of paths through a node).

Constructor parameters in org.neo4j.graphalgo.impl.centrality with type arguments of type Relationship

EigenvectorCentralityArnoldi(Direction relationDirection, CostEvaluator<Double> costEvaluator, Set<Node> nodeSet, Set<Relationship> relationshipSet, double precision)

EigenvectorCentralityPower(Direction relationDirection, CostEvaluator<Double> costEvaluator, Set<Node> nodeSet, Set<Relationship> relationshipSet, double precision)

Uses of Relationship in org.neo4j.graphalgo.impl.shortestpath

Fields in org.neo4j.graphalgo.impl.shortestpath with type parameters of type Relationship

protected HashMap<Node,List<Relationship>>	SingleSourceShortestPathBFS.predecessors
protected HashMap<Node,List<Relationship>>	Dijkstra.DijstraIterator.predecessors
protected HashMap<Node,List<Relationship>>	Dijkstra.predecessors1
protected HashMap<Node,List<Relationship>>	Dijkstra.predecessors2
protected Set<Relationship>	FloydWarshall.relationshipSet

Methods in org.neo4j.graphalgo.impl.shortestpath that return types with arguments of type Relationship

protected static List<LinkedList<Relationship>>	Util.constructAllPathsToNodeAsRelationshipLinkedLists(Node node, Map<Node,List<Relationship>> predecessors, boolean backwards) Same as constructAllPathsToNodeAsRelationships, but different return type
static List<List<Relationship>>	Util.constructAllPathsToNodeAsRelationships(Node node, Map<Node,List<Relationship>> predecessors, boolean backwards) Constructs all paths to a given node, for a given set of predecessors.
static List<Relationship>	Util.constructSinglePathToNodeAsRelationships(Node node, Map<Node,List<Relationship>> predecessors, boolean backwards) Constructs a path to a given node, for a given set of predecessors
List<Relationship>	SingleSourceSingleSinkShortestPath.getPathAsRelationships() A call to this will run the algorithm to find a single shortest path, if not already done, and return it as a list of Relationships.
List<Relationship>	SingleSourceShortestPathDijkstra.getPathAsRelationships()
List<Relationship>	Dijkstra.getPathAsRelationships()
List<Relationship>	SingleSourceShortestPathDijkstra.getPathAsRelationships(Node targetNode)
List<Relationship>	SingleSourceShortestPathBFS.getPathAsRelationships(Node targetNode)
List<Relationship>	SingleSourceShortestPath.getPathAsRelationships(Node targetNode) A call to this will run the algorithm to find a single shortest path, if not already done, and return it as a list of Relationships.
List<List<Relationship>>	SingleSourceSingleSinkShortestPath.getPathsAsRelationships() A call to this will run the algorithm to find all shortest paths, if not already done, and return them as lists of relationships.
List<List<Relationship>>	SingleSourceShortestPathDijkstra.getPathsAsRelationships()
List<List<Relationship>>	Dijkstra.getPathsAsRelationships()
List<List<Relationship>>	SingleSourceShortestPathDijkstra.getPathsAsRelationships(Node targetNode)
List<List<Relationship>>	SingleSourceShortestPathBFS.getPathsAsRelationships(Node targetNode)
List<List<Relationship>>	SingleSourceShortestPath.getPathsAsRelationships(Node targetNode) A call to this will run the algorithm to find all shortest paths, if not already done, and return them as lists of relationships.
Map<Node,List<Relationship>>	SingleSourceShortestPathDijkstra.getPredecessors()
Map<Node,List<Relationship>>	SingleSourceShortestPathBFS.getPredecessors()
Map<Node,List<Relationship>>	SingleSourceShortestPath.getPredecessors() This can be used to retrieve the entire data structure representing the predecessors for every node.
static Map<Node,List<Relationship>>	Util.reversedPredecessors(Map<Node,List<Relationship>> predecessors) This can be used to generate the inverse of a structure with predecessors, i.e.

Method parameters in org.neo4j.graphalgo.impl.shortestpath with type arguments of type Relationship

static List<List<PropertyContainer>>	Util.constructAllPathsToNode(Node node, Map<Node,List<Relationship>> predecessors, boolean includeNode, boolean backwards) Constructs all paths to a given node, for a given set of predecessors
protected static List<LinkedList<PropertyContainer>>	Util.constructAllPathsToNodeAsLinkedLists(Node node, Map<Node,List<Relationship>> predecessors, boolean includeNode, boolean backwards) Same as constructAllPathsToNode, but different return type
protected static List<LinkedList<Node>>	Util.constructAllPathsToNodeAsNodeLinkedLists(Node node, Map<Node,List<Relationship>> predecessors, boolean includeNode, boolean backwards) Same as constructAllPathsToNodeAsNodes, but different return type
static List<List<Node>>	Util.constructAllPathsToNodeAsNodes(Node node, Map<Node,List<Relationship>> predecessors, boolean includeNode, boolean backwards) Constructs all paths to a given node, for a given set of predecessors
protected static List<LinkedList<Relationship>>	Util.constructAllPathsToNodeAsRelationshipLinkedLists(Node node, Map<Node,List<Relationship>> predecessors, boolean backwards) Same as constructAllPathsToNodeAsRelationships, but different return type
static List<List<Relationship>>	Util.constructAllPathsToNodeAsRelationships(Node node, Map<Node,List<Relationship>> predecessors, boolean backwards) Constructs all paths to a given node, for a given set of predecessors.
static List<PropertyContainer>	Util.constructSinglePathToNode(Node node, Map<Node,List<Relationship>> predecessors, boolean includeNode, boolean backwards) Constructs a path to a given node, for a given set of predecessors.
static List<Node>	Util.constructSinglePathToNodeAsNodes(Node node, Map<Node,List<Relationship>> predecessors, boolean includeNode, boolean backwards) Constructs a path to a given node, for a given set of predecessors
static List<Relationship>	Util.constructSinglePathToNodeAsRelationships(Node node, Map<Node,List<Relationship>> predecessors, boolean backwards) Constructs a path to a given node, for a given set of predecessors
static Map<Node,List<Relationship>>	Util.reversedPredecessors(Map<Node,List<Relationship>> predecessors) This can be used to generate the inverse of a structure with predecessors, i.e.

Constructor parameters in org.neo4j.graphalgo.impl.shortestpath with type arguments of type Relationship

Dijkstra.DijstraIterator(Node startNode, HashMap<Node,List<Relationship>> predecessors, HashMap<Node,CostType> mySeen, HashMap<Node,CostType> otherSeen, HashMap<Node,CostType> myDistances, HashMap<Node,CostType> otherDistances, boolean backwards)

FloydWarshall(CostType startCost, CostType infinitelyBad, Direction relationDirection, CostEvaluator<CostType> costEvaluator, CostAccumulator<CostType> costAccumulator, Comparator<CostType> costComparator, Set<Node> nodeSet, Set<Relationship> relationshipSet)

Util.PathCounter(Map<Node,List<Relationship>> predecessors)

Uses of Relationship in org.neo4j.graphalgo.impl.util

Methods in org.neo4j.graphalgo.impl.util that return Relationship

Relationship	PathImpl.lastRelationship()
Relationship	WeightedPathImpl.lastRelationship()

Methods in org.neo4j.graphalgo.impl.util that return types with arguments of type Relationship

Iterable<Relationship>	PathImpl.relationships()
Iterable<Relationship>	WeightedPathImpl.relationships()

Methods in org.neo4j.graphalgo.impl.util with parameters of type Relationship

Double	DoubleEvaluatorWithDefault.getCost(Relationship relationship, Direction direction)
Double	DoubleEvaluator.getCost(Relationship relationship, Direction direction)
Integer	IntegerEvaluator.getCost(Relationship relationship, Direction direction)
PathImpl.Builder	PathImpl.Builder.push(Relationship relationship)

Uses of Relationship in org.neo4j.graphdb

Methods in org.neo4j.graphdb that return Relationship

Relationship	Node.createRelationshipTo(Node otherNode, RelationshipType type) Creates a relationship between this node and another node.
Relationship	GraphDatabaseService.getRelationshipById(long id) Looks up a relationship by id.
Relationship	Node.getSingleRelationship(RelationshipType type, Direction dir) Returns the only relationship of a given type and direction that is attached to this node, or null.
Relationship	Path.lastRelationship() Returns the last Relationship in this path.
Relationship	TraversalPosition.lastRelationshipTraversed() Return the last relationship traversed.

Methods in org.neo4j.graphdb that return types with arguments of type Relationship

Iterable<Relationship>	RelationshipExpander.expand(Node node) Returns relationships for a node in whatever way the implementation likes.
Iterable<Relationship>	Node.getRelationships() Returns all the relationships attached to this node.
Iterable<Relationship>	Node.getRelationships(Direction dir) Returns all OUTGOING or INCOMING relationships from this node.
Iterable<Relationship>	Node.getRelationships(Direction direction, RelationshipType... types) Returns all the relationships of any of the types in types that are attached to this node and have the given direction.
Iterable<Relationship>	Node.getRelationships(RelationshipType... types) Returns all the relationships of any of the types in types that are attached to this node, regardless of direction.
Iterable<Relationship>	Node.getRelationships(RelationshipType type, Direction dir) Returns all relationships with the given type and direction that are attached to this node.
Iterable<Relationship>	Path.relationships() Returns all the relationships in between the nodes which this path consists of.

Method parameters in org.neo4j.graphdb with type arguments of type Relationship

Expander	Expander.addRelationshipFilter(Predicate<? super Relationship> filter) Add a Relationship filter.
Expander	Expander.addRelationsipFilter(Predicate<? super Relationship> filter) Deprecated. because of typo, use Expander.addRelationshipFilter(Predicate) instead

Uses of Relationship in org.neo4j.graphdb.event

Methods in org.neo4j.graphdb.event that return types with arguments of type Relationship

Iterable<PropertyEntry<Relationship>>	TransactionData.assignedRelationshipProperties() Get the properties that had a value assigned on a relationship during the transaction.
Iterable<Relationship>	TransactionData.createdRelationships() Get the relationships that were created during the transaction.
Iterable<Relationship>	TransactionData.deletedRelationships() Get the relationships that were deleted during the transaction.
Iterable<PropertyEntry<Relationship>>	TransactionData.removedRelationshipProperties() Get the properties that had a value removed from a relationship during the transaction.

Methods in org.neo4j.graphdb.event with parameters of type Relationship

boolean

TransactionData.isDeleted(Relationship relationship) Returns whether or not relationship is deleted in this transaction.

Uses of Relationship in org.neo4j.graphdb.index

Methods in org.neo4j.graphdb.index that return types with arguments of type Relationship

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.

Methods in org.neo4j.graphdb.index with parameters of type Relationship

protected void	UniqueFactory.UniqueRelationshipFactory.delete(Relationship relationship) Default implementation of UniqueFactory.delete(PropertyContainer).
protected void	UniqueFactory.UniqueRelationshipFactory.initialize(Relationship relationship, Map<String,Object> properties) Default implementation of UniqueFactory.initialize(PropertyContainer, Map), does nothing for Relationships.

Constructor parameters in org.neo4j.graphdb.index with type arguments of type Relationship

UniqueFactory.UniqueRelationshipFactory(Index<Relationship> index)
Create a new UniqueFactory for relationships.

Uses of Relationship in org.neo4j.graphdb.traversal

Methods in org.neo4j.graphdb.traversal that return Relationship

Relationship

TraversalBranch.relationship() The relationship for this expansion source.

Methods in org.neo4j.graphdb.traversal that return types with arguments of type Relationship

Iterable<Relationship>

Traverser.relationships() Represents the traversal in the form of Relationships.

Uses of Relationship in org.neo4j.graphmatching

Methods in org.neo4j.graphmatching that return Relationship

Relationship	PatternElement.getFromRelationship() Returns the Relationship traversed to get to the Node returned from PatternElement.getNode().
Relationship	PatternMatch.getRelationshipFor(PatternRelationship rel)

Uses of Relationship in org.neo4j.kernel

Methods in org.neo4j.kernel that return Relationship

Relationship	EmbeddedGraphDatabase.getRelationshipById(long id)
Relationship	EmbeddedReadOnlyGraphDatabase.getRelationshipById(long id)
Relationship	HAGraphDb.getRelationshipById(long id)

Methods in org.neo4j.kernel that return types with arguments of type Relationship

org.neo4j.kernel.Expansion<Relationship>

StandardExpander.expand(Node start)

Methods in org.neo4j.kernel with parameters of type Relationship

protected WrappedRelationship<? extends WrappedGraphDatabase>	HighlyAvailableGraphDatabase.relationship(Relationship relationship, boolean created)
String	Traversal.DefaultPathDescriptor.relationshipRepresentation(Path path, Node from, Relationship relationship)
String	Traversal.PathDescriptor.relationshipRepresentation(T path, Node from, Relationship relationship) Returns a string representation of a Relationship.

Method parameters in org.neo4j.kernel with type arguments of type Relationship

StandardExpander	StandardExpander.addRelationshipFilter(Predicate<? super Relationship> filter)
StandardExpander	StandardExpander.addRelationsipFilter(Predicate<? super Relationship> filter)

Uses of Relationship in org.neo4j.kernel.ha

Classes in org.neo4j.kernel.ha that implement Relationship

class

LockableRelationship

Methods in org.neo4j.kernel.ha that return Relationship

Relationship	LockableNode.createRelationshipTo(Node otherNode, RelationshipType type)
Relationship	LockableNode.getSingleRelationship(RelationshipType type, Direction dir)

Methods in org.neo4j.kernel.ha that return types with arguments of type Relationship

Iterable<Relationship>	LockableNode.getRelationships()
Iterable<Relationship>	LockableNode.getRelationships(Direction dir)
Iterable<Relationship>	LockableNode.getRelationships(Direction direction, RelationshipType... types)
Iterable<Relationship>	LockableNode.getRelationships(RelationshipType... types)
Iterable<Relationship>	LockableNode.getRelationships(RelationshipType type, Direction dir)

Uses of Relationship in org.neo4j.kernel.impl.core

Methods in org.neo4j.kernel.impl.core that return Relationship

Relationship	NodeManager.createRelationship(org.neo4j.kernel.impl.core.NodeImpl startNode, Node endNode, RelationshipType type)
Relationship	NodeManager.getRelationshipById(long relId)

Method parameters in org.neo4j.kernel.impl.core with type arguments of type Relationship

void	NodeManager.addRelationshipPropertyTracker(PropertyTracker<Relationship> relationshipPropertyTracker)
void	NodeManager.removeRelationshipPropertyTracker(PropertyTracker<Relationship> relationshipPropertyTracker)

Uses of Relationship in org.neo4j.kernel.impl.traversal

Methods in org.neo4j.kernel.impl.traversal that return Relationship

Relationship	TraversalPath.lastRelationship()
Relationship	FinalTraversalBranch.relationship()

Methods in org.neo4j.kernel.impl.traversal that return types with arguments of type Relationship

Iterable<Relationship>

TraversalPath.relationships()

Constructors in org.neo4j.kernel.impl.traversal with parameters of type Relationship

FinalTraversalBranch(Node head, Relationship... path)

Uses of Relationship in org.neo4j.tooling.wrap

Classes in org.neo4j.tooling.wrap that implement Relationship

class

WrappedRelationship<G extends WrappedGraphDatabase>

Methods in org.neo4j.tooling.wrap that return Relationship

Relationship	WrappedNode.createRelationshipTo(Node otherNode, RelationshipType type)
Relationship	WrappedGraphDatabase.getRelationshipById(long id)
Relationship	WrappedNode.getSingleRelationship(RelationshipType type, Direction dir)

Methods in org.neo4j.tooling.wrap that return types with arguments of type Relationship

IndexHits<Relationship>	WrappedIndex.WrappedRelationshipIndex.get(String key, Object valueOrNull, Node startNodeOrNull, Node endNodeOrNull)
Iterable<Relationship>	WrappedNode.getRelationships()
Iterable<Relationship>	WrappedNode.getRelationships(Direction dir)
Iterable<Relationship>	WrappedNode.getRelationships(Direction direction, RelationshipType... types)
Iterable<Relationship>	WrappedNode.getRelationships(RelationshipType... types)
Iterable<Relationship>	WrappedNode.getRelationships(RelationshipType type, Direction dir)
IndexHits<Relationship>	WrappedIndex.WrappedRelationshipIndex.query(Object queryOrQueryObjectOrNull, Node startNodeOrNull, Node endNodeOrNull)
IndexHits<Relationship>	WrappedIndex.WrappedRelationshipIndex.query(String key, Object queryOrQueryObjectOrNull, Node startNodeOrNull, Node endNodeOrNull)

Methods in org.neo4j.tooling.wrap with parameters of type Relationship

protected abstract WrappedRelationship<? extends WrappedGraphDatabase>

WrappedGraphDatabase.relationship(Relationship relationship, boolean created)