Examples of org.neo4j.graphdb.Node.traverse()

org.neo4j.graphdb.Node.traverse()

Instantiates a traverser that will start at this node and traverse according to the given order and evaluators along the specified relationship type and direction. If the traverser should traverse more than one RelationshipType/Direction pair, use one of the overloaded variants of this method. The created traverser will iterate over each node that can be reached from this node by the spanning tree formed by the given relationship types (with direction) exactly once. For more information about traversal, see the {@link Traverser}documentation. @param traversalOrder the traversal order @param stopEvaluator an evaluator instructing the new traverser aboutwhen to stop traversing, either a predefined evaluator such as {@link StopEvaluator#END_OF_GRAPH} or a custom-writtenevaluator @param returnableEvaluator an evaluator instructing the new traverserabout whether a specific node should be returned from the traversal, either a predefined evaluator such as {@link ReturnableEvaluator#ALL} or a customer-writtenevaluator @param relationshipType the relationship type that the traverser willtraverse along @param direction the direction in which the relationships of typerelationshipType will be traversed @return a new traverser, configured as above

    @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
        {

    public void testBruteDepthTraversal() throws Exception
    {
        Node root = this.buildIseTreePopulation();
        RelationshipType[] traversableRels = new RelationshipType[] {
            MyRelTypes.TEST, MyRelTypes.TEST_TRAVERSAL };
        Traverser traverser = root.traverse( DEPTH_FIRST,
            StopEvaluator.END_OF_GRAPH, ReturnableEvaluator.ALL,
            traversableRels[0], Direction.BOTH, traversableRels[1],
            Direction.BOTH );


        try

            // there can't be any relationships ...
            // view.addCurrentNode();
            return EMPTY_REL_ARRAY;
        }
        Node node = (Node) input;
        Traverser trav = node.traverse( Order.BREADTH_FIRST,
                new StopEvaluator()
                {
                    @Override
                    public boolean isStopNode(
                            final TraversalPosition currentPos )

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.