Examples of org.neo4j.graphdb.Relationship

org.neo4j.graphdb.Relationship
we have: (a) --- REL_TYPE ---> (b) assert rel. {@link Relationship#getStartNode() getStartNode}().equals( a ); assert rel. {@link Relationship#getEndNode() getEndNode}().equals( b ); assert rel. {@link Relationship#getNodes() getNodes}()[0].equals( a ) && rel. {@link Relationship#getNodes() getNodes}()[1].equals( b ); Even though all relationships have a direction they are equally well traversed in both directions so there's no need to create duplicate relationships in the opposite direction (with regard to traversal or performance).
Furthermore, Neo4j guarantees that a relationship is never "hanging freely," i.e. {@link #getStartNode()}, {@link #getEndNode()}, {@link #getOtherNode(Node)} and {@link #getNodes()} are guaranteed to alwaysreturn valid, non-null nodes.
The id of a relationship is unique, but may not be unique over time since neo4j reuses deleted ids. See http://wiki.neo4j.org/content/Id_Reuse

  Node getUnderlyingNode() {
    return treeNode;
  }


  TreeNode getParent() {
    Relationship toParentNode = treeNode.getSingleRelationship(
        RelTypes.SUB_TREE, Direction.INCOMING);
    if (toParentNode != null) {
      Node parentNode = toParentNode.getStartNode();
      Relationship prevEntry = parentNode.getSingleRelationship(
          RelTypes.KEY_ENTRY, Direction.INCOMING);
      while (prevEntry != null) {
        parentNode = prevEntry.getStartNode();
        prevEntry = parentNode.getSingleRelationship(
            RelTypes.KEY_ENTRY, Direction.INCOMING);
      }
      return new TreeNode(bTree, parentNode);
    }

View Full Code Here

    return null;
  }


  // returns the old parent node
  private Node disconnectFromParent() {
    Relationship toParentNode = treeNode.getSingleRelationship(
        RelTypes.SUB_TREE, Direction.INCOMING);
    Node parentNode = toParentNode.getStartNode();
    toParentNode.delete();
    return parentNode;
  }

View Full Code Here

    }
    return count;
  }


  NodeEntry getFirstEntry() {
    Relationship keyEntryRel = treeNode.getSingleRelationship(
        RelTypes.KEY_ENTRY, Direction.OUTGOING);
    assert treeNode.getSingleRelationship(RelTypes.KEY_ENTRY,
        Direction.INCOMING) == null;
    if (keyEntryRel != null) {
      return new NodeEntry(this, keyEntryRel);

View Full Code Here

    }
    return null;
  }


  NodeEntry getLastEntry() {
    Relationship keyEntryRel = treeNode.getSingleRelationship(
        RelTypes.KEY_ENTRY, Direction.OUTGOING);
    NodeEntry last = null;
    while (keyEntryRel != null) {
      last = new NodeEntry(this, keyEntryRel);
      keyEntryRel = keyEntryRel.getEndNode().getSingleRelationship(
          RelTypes.KEY_ENTRY, Direction.OUTGOING);
    }
    return last;
  }

View Full Code Here

          entry = entry.getNextKey();
        }
        // create new blank node for key entry relationship
        Node blankNode = bTree.getGraphDb().createNode();
        NodeEntry nodeEntry = createEntry(keyEntry.getStartNode(), blankNode);
                Relationship keyValueRelationship = nodeEntry.addNode( theNode );
        // move previous keyEntry to start at blank node
        keyEntry.move(this, blankNode, keyEntry.getEndNode());
        entryCount++;
        assert entryCount <= bTree.getOrder();
        if (bTree.getOrder() == entryCount) {
          moveMiddleUp();
        }
        return keyValueRelationship;
      }
      // else if last entry, check for sub tree or add last
      if (keyEntry.getNextKey() == null) {
        // check if we have subtree
        TreeNode subTree = keyEntry.getAfterSubTree();
        if (subTree != null) {
          return subTree.addEntry(theNode, ignoreIfExist);
        }
        // ok just append the element
        Node blankNode = bTree.getGraphDb().createNode();
        NodeEntry nodeEntry = createEntry(keyEntry.getEndNode(), blankNode);
                Relationship keyValueRelationship = nodeEntry.addNode( theNode );
        entryCount++;
        assert entryCount <= bTree.getOrder();
        if (bTree.getOrder() == entryCount) {
          moveMiddleUp();
        }

View Full Code Here

    for(Relationship rel: entryToMoveDown.getEndNode().getRelationships(NodeCollection.RelationshipTypes.VALUE, Direction.OUTGOING)){
      nl2.add(new TempRelationship(rel));
      rel.delete();
    }
    for(TempRelationship trl: nl1){
      Relationship rel = entryToMoveDown.getEndNode().createRelationshipTo(trl.getEndNode(), NodeCollection.RelationshipTypes.VALUE);
      for(String key: trl.getProperties().keySet()){
        rel.setProperty(key, trl.getProperties().get(key));
      }
    }
    
    Node newStartNode = bTree.getGraphDb().createNode();
    Node oetmd = entryToMoveDown.getEndNode(); 
    entryToMoveDown.move(this, newStartNode, treeNode);
    for(TempRelationship trl: nl2){
      Relationship rel = oetmd.createRelationshipTo(trl.getEndNode(), NodeCollection.RelationshipTypes.VALUE);
      for(String key: trl.getProperties().keySet()){
        rel.setProperty(key, trl.getProperties().get(key));
      }
    }
    Node parentToReAttachTo = disconnectFromParent();
    treeNode = newStartNode;
    connectToParent(parentToReAttachTo);

View Full Code Here

    for(Relationship rel: entryToMoveDown.getEndNode().getRelationships(NodeCollection.RelationshipTypes.VALUE, Direction.OUTGOING)){
      nl2.add(new TempRelationship(rel));
      rel.delete();
    }
    for(TempRelationship trl: nl1){
      Relationship rel = entryToMoveDown.getEndNode().createRelationshipTo(trl.getEndNode(), NodeCollection.RelationshipTypes.VALUE);
      for(String key: trl.getProperties().keySet()){
        rel.setProperty(key, trl.getProperties().get(key));
      }
    }
    Node newLastNode = bTree.getGraphDb().createNode();
    Node oetmd = entryToMoveDown.getEndNode();    
    entryToMoveDown.move(this, this.getLastEntry().getEndNode(), newLastNode);
    for(TempRelationship trl: nl2){
      Relationship rel = oetmd.createRelationshipTo(trl.getEndNode(), NodeCollection.RelationshipTypes.VALUE);
      for(String key: trl.getProperties().keySet()){
        rel.setProperty(key, trl.getProperties().get(key));
      }
    }
    if (subTree != null) {
      subTree.connectToParent(newLastNode);
    }

View Full Code Here

      bTree.makeRoot(this);
    }
  }


  TreeNode getLeftSibbling() {
    Relationship parent = treeNode.getSingleRelationship(RelTypes.SUB_TREE,
        Direction.INCOMING);
    if (parent == null) {
      return null;
    }
    Relationship prevEntry = parent.getStartNode().getSingleRelationship(
        RelTypes.KEY_ENTRY, Direction.INCOMING);
    if (prevEntry == null) {
      return null;
    }
    return new TreeNode(getBTree(), prevEntry.getStartNode()
        .getSingleRelationship(RelTypes.SUB_TREE, Direction.OUTGOING)
        .getEndNode());
  }

View Full Code Here

        .getSingleRelationship(RelTypes.SUB_TREE, Direction.OUTGOING)
        .getEndNode());
  }


  TreeNode getRightSibbling() {
    Relationship parent = treeNode.getSingleRelationship(RelTypes.SUB_TREE,
        Direction.INCOMING);
    if (parent == null) {
      return null;
    }
    Relationship nextEntry = parent.getStartNode().getSingleRelationship(
        RelTypes.KEY_ENTRY, Direction.OUTGOING);
    if (nextEntry == null) {
      return null;
    }
    return new TreeNode(getBTree(), nextEntry.getEndNode()
        .getSingleRelationship(RelTypes.SUB_TREE, Direction.OUTGOING)
        .getEndNode());
  }

View Full Code Here

      else
      {
        underlyingNode.setProperty( MAP_NAME, name );
        this.name = name;
      }
      Relationship bTreeRel = underlyingNode.getSingleRelationship( 
        BTree.RelTypes.TREE_ROOT, 
        Direction.OUTGOING );
      if ( bTreeRel != null )
      {
        bTree = new BTree( graphDb, bTreeRel.getEndNode() );
      }
      else
      {
        Node bTreeNode = graphDb.createNode();
        underlyingNode.createRelationshipTo( bTreeNode,

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of org.neo4j.graphdb.Relationship

com.cedarsoft.serialization.neo4j.AbstractNeo4jSerializer

com.drighetto.neo4j.SocialNetworkSample

com.eugeneborshch.routecalculator.optimize.WayStartNodeFinder

com.graphaware.common.util.DirectionUtilsTest

de.alpengeist.NeoFeeder

de.metalcon.socialgraph.NeoUtils

er.neo4jadaptor.ersatz.neo4j.Neo4JNodeErsatz

examples.ImdbExampleTest

examples.PathFindingExamplesTest

ie.transportdublin.shortestpath.ShortestPath

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.