Examples of org.neo4j.graphdb.Traverser

org.neo4j.graphdb.Traverser
} Relationships are equally well traversed regardless of their direction, performance-wise.
For more usage examples please refer to the wiki documentation. @see Node#traverse

    @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" );

View Full Code Here

                }
            }
        };


        // 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" );
            this.assertNextNodeId( traverser, "5" );
            this.assertNextNodeId( traverser, "6" );


            assertTrue( "Too many nodes returned from traversal", traverser
                .iterator().hasNext() == false );
        }
        catch ( java.util.NoSuchElementException nsee )
        {
            fail( "Too few nodes returned from traversal" );

View Full Code Here

                }
            }
        };


        // 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" );

View Full Code Here

                return position.depth() >= 2;
            }
        };


        // 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" );
            this.assertNextNodeId( traverser, "5" );
            this.assertNextNodeId( traverser, "6" );
            this.assertNextNodeId( traverser, "7" );


            assertTrue( "Too many nodes returned from traversal", traverser
                .iterator().hasNext() == false );
        }
        catch ( java.util.NoSuchElementException nsee )
        {
            fail( "Too few nodes returned from traversal" );

View Full Code Here

                return position.returnedNodesCount() < 5;
            }
        };


        // Create a traverser
        Traverser traverser = root.traverse( BREADTH_FIRST, stopEvaluator,
            returnEvaluator, traversableRels[0], Direction.BOTH );


        try
        {
            this.assertLevelsOfNodes( traverser, new String[][] {
                new String[] { "1" },
                new String[] { "2", "3", "4" },
                new String[] { "5" },
            } );


            assertTrue( "Too many nodes returned from traversal", traverser
                .iterator().hasNext() == false );
        }
        catch ( java.util.NoSuchElementException nsee )
        {
            fail( "Too few nodes returned from traversal" );

View Full Code Here

                return rel != null && rel.isType( MyRelTypes.TEST_TRAVERSAL );
            }
        };


        // Create a traverser
        Traverser traverser = root.traverse( BREADTH_FIRST, stopEvaluator,
            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" }
            } );


            assertTrue( "Too many nodes returned from traversal", traverser
                .iterator().hasNext() == false );
        }
        catch ( java.util.NoSuchElementException nsee )
        {
            fail( "Too few nodes returned from traversal" );

View Full Code Here

            // 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 )
                    {
                        return currentPos.depth() >= depth;
                    }
                }, ReturnableEvaluator.ALL, relDirList.toArray() );
        Set<Relationship> rels = new HashSet<Relationship>();
        for ( Node current : trav )
        {
            if ( trav.currentPosition().depth() != depth )
            {
                for ( Relationship rel : current.getRelationships( Direction.OUTGOING ) )
                {
                    rels.add( rel );
                }

View Full Code Here

0 1

TOP

Related Classes of org.neo4j.graphdb.Traverser

com.drighetto.neo4j.SocialNetworkSample

org.neo4j.collections.btree.AbstractBTree

org.neo4j.collections.btree.BTree

org.neo4j.collections.timeline.Timeline

org.neo4j.examples.imdb.util.SimplePathFinder_Old

org.neo4j.kernel.impl.traversal.CircularGraphTest

org.neo4j.kernel.impl.traversal.TestTraversal

org.neo4j.neoclipse.view.NeoGraphRelationshipContentProvider

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.