Examples with Traverser org.neo4j.graphdb.Traverser used on opensource projects

Example 6 with Traverser

use of org.neo4j.graphdb.Traverser in project graphdb by neo4j-attic.

the class TestTraversal method testMultiRelDepthTraversal.

// Traverses the test "ise-tree-like" population depth first,
// but only traverses "ise" relationships (the population also contains
// "ise_clone" rels)
@Test
public void testMultiRelDepthTraversal() throws Exception {
    Node root = this.buildIseTreePopulation();
    RelationshipType[] traversableRels = new RelationshipType[] { MyRelTypes.TEST };
    Traverser traverser = root.traverse(DEPTH_FIRST, StopEvaluator.END_OF_GRAPH, ReturnableEvaluator.ALL, traversableRels[0], Direction.BOTH);
    try {
        assertNodes(traverser, "1", "2", "3", "4", "5", "6", "7", "10", "11", "12", "13");
        assertTrue("Too many nodes returned from traversal", traverser.iterator().hasNext() == false);
    } catch (java.util.NoSuchElementException nsee) {
        fail("Too few nodes returned from traversal");
    } finally {
        this.deleteNodeTreeRecursively(root, 0);
    }
}

Example 7 with Traverser

use of org.neo4j.graphdb.Traverser in project graphdb by neo4j-attic.

the class CircularGraphTest method testCircularBug.

@Test
public void testCircularBug() {
    final long timestamp = 3;
    Transaction tx = beginTx();
    getNodeWithName("2").setProperty("timestamp", 1L);
    getNodeWithName("3").setProperty("timestamp", 2L);
    tx.success();
    tx.finish();
    final RelationshipType type = DynamicRelationshipType.withName("TO");
    Traverser t = referenceNode().traverse(Order.DEPTH_FIRST, new StopEvaluator() {

        public boolean isStopNode(TraversalPosition position) {
            Relationship last = position.lastRelationshipTraversed();
            if (last != null && last.isType(type)) {
                Node node = position.currentNode();
                long currentTime = (Long) node.getProperty("timestamp");
                return currentTime >= timestamp;
            }
            return false;
        }
    }, new ReturnableEvaluator() {

        public boolean isReturnableNode(TraversalPosition position) {
            Relationship last = position.lastRelationshipTraversed();
            if (last != null && last.isType(type)) {
                return true;
            }
            return false;
        }
    }, type, Direction.OUTGOING);
    Iterator<Node> nodes = t.iterator();
    assertEquals("2", nodes.next().getProperty("name"));
    assertEquals("3", nodes.next().getProperty("name"));
    assertFalse(nodes.hasNext());
}

Example 8 with Traverser

use of org.neo4j.graphdb.Traverser in project graphdb by neo4j-attic.

the class TestTraversal method testMultiRelBreadthTraversal.

// Traverses the test "ise-tree-like" population breadth first,
// but only traverses "ise" (TEST) relationships (the population also
// contains
// "ise_clone" (TEST_TRAVERSAL) rels)
@Test
public void testMultiRelBreadthTraversal() throws Exception {
    Node root = this.buildIseTreePopulation();
    RelationshipType[] traversableRels = new RelationshipType[] { MyRelTypes.TEST };
    Traverser traverser = root.traverse(BREADTH_FIRST, StopEvaluator.END_OF_GRAPH, ReturnableEvaluator.ALL, traversableRels[0], Direction.BOTH);
    try {
        this.assertLevelsOfNodes(traverser, new String[][] { new String[] { "1" }, new String[] { "2", "3", "4" }, new String[] { "5", "6", "7" }, new String[] { "10", "11", "12", "13" } });
        assertTrue("Too many nodes returned from traversal", traverser.iterator().hasNext() == false);
    } catch (java.util.NoSuchElementException nsee) {
        fail("Too few nodes returned from traversal");
    } finally {
        this.deleteNodeTreeRecursively(root, 0);
    }
}

Example 9 with Traverser

use of org.neo4j.graphdb.Traverser in project graphdb by neo4j-attic.

the class TestTraversal method testStopOnPreviousNode.

// Verifies that the stop evaluator can stop based on the previous node
@Test
public void testStopOnPreviousNode() throws Exception {
    // Build ise tree
    Node root = this.buildIseTreePopulation();
    // Traverse only ISE relationships
    RelationshipType[] traversableRels = new RelationshipType[] { MyRelTypes.TEST };
    // Construct a stop evaluator that stops on nodes 2, 3, and 4
    // (ie root's children)
    StopEvaluator stopEvaluator = new StopEvaluator() {

        public boolean isStopNode(TraversalPosition position) {
            try {
                Node node = position.previousNode();
                String nodeId = (String) node.getProperty("node.test.id");
                return nodeId.equals("1");
            } catch (Exception e) {
                return false;
            }
        }
    };
    // Create a traverser
    Traverser traverser = root.traverse(BREADTH_FIRST, stopEvaluator, ReturnableEvaluator.ALL, traversableRels[0], Direction.BOTH);
    try {
        this.assertNextNodeId(traverser, "1");
        this.assertNextNodeId(traverser, "2");
        this.assertNextNodeId(traverser, "3");
        this.assertNextNodeId(traverser, "4");
        assertTrue("Too many nodes returned from traversal", traverser.iterator().hasNext() == false);
    } catch (java.util.NoSuchElementException nsee) {
        fail("Too few nodes returned from traversal");
    } finally {
        // Delete ise tree and commmit work
        this.deleteNodeTreeRecursively(root, 0);
    }
}

Example 10 with Traverser

use of org.neo4j.graphdb.Traverser in project graphdb by neo4j-attic.

the class TestTraversal method testBruteBreadthTraversal.

// Traverses the full test "ise-tree-like" population breadth first
// and verifies that it is returned in correct order
@Test
public void testBruteBreadthTraversal() throws Exception {
    Node root = this.buildIseTreePopulation();
    RelationshipType[] traversableRels = new RelationshipType[] { MyRelTypes.TEST, MyRelTypes.TEST_TRAVERSAL };
    Traverser traverser = root.traverse(BREADTH_FIRST, StopEvaluator.END_OF_GRAPH, ReturnableEvaluator.ALL, traversableRels[0], Direction.BOTH, traversableRels[1], Direction.BOTH);
    try {
        this.assertLevelsOfNodes(traverser, new String[][] { new String[] { "1" }, new String[] { "2", "3", "4" }, new String[] { "5", "6", "7", "8", "9" }, new String[] { "10", "11", "12", "13", "14" } });
        assertTrue("Too many nodes returned from traversal", traverser.iterator().hasNext() == false);
    } catch (java.util.NoSuchElementException nsee) {
        fail("Too few nodes returned from traversal");
    } finally {
        this.deleteNodeTreeRecursively(root, 0);
    }
}