Examples of org.neo4j.graphdb.traversal.Traverser

org.neo4j.graphdb.traversal.Traverser
This interface represents the traverser which is used to step through the results of a traversal. Each step can be represented in different ways. The default is as {@link Path} objects which all other representations can bederived from, i.e {@link Node} or {@link Relationship}. Each step can also be represented in one of those representations directly.

    }


    @Test
    public void testSmallestPossibleInit() throws Exception
    {
        Traverser traversal = Traversal.description().traverse( referenceNode() );
        int count = 0;
        for ( Path position : traversal )
        {
            count++;
            assertNotNull( position );

View Full Code Here

        testAllNodesAreReturnedOnce( Traversal.description().breadthFirst() );
    }


    private void testAllNodesAreReturnedOnce( TraversalDescription traversal )
    {
        Traverser traverser = traversal.uniqueness( Uniqueness.NODE_GLOBAL ).traverse(
                referenceNode() );


        expectNodes( traverser, "1", "2", "3", "4", "5", "6" );
    }

View Full Code Here

    }


    private void testNodesAreReturnedOnceWhenSufficientRecentlyUnique(
            TraversalDescription description )
    {
        Traverser traverser = description.uniqueness( Uniqueness.NODE_RECENT, 6 ).traverse(
                referenceNode() );


        expectNodes( traverser, "1", "2", "3", "4", "5", "6" );
    }

View Full Code Here

    }


    private void testAllRelationshipsAreReturnedOnce(
            TraversalDescription description ) throws Exception
    {
        Traverser traverser = Traversal.description().uniqueness(
                Uniqueness.RELATIONSHIP_GLOBAL ).traverse( referenceNode() );


        expectRelationships( traverser, THE_WORLD_AS_WE_KNOW_IT );
    }

View Full Code Here

    }


    private void testRelationshipsAreReturnedOnceWhenSufficientRecentlyUnique(
            TraversalDescription description ) throws Exception
    {
        Traverser traverser = description.uniqueness(
                Uniqueness.RELATIONSHIP_RECENT, THE_WORLD_AS_WE_KNOW_IT.length ).traverse(
                referenceNode() );


        expectRelationships( traverser, THE_WORLD_AS_WE_KNOW_IT );
    }

View Full Code Here

    }


    private void testAllUniqueNodePathsAreReturned( TraversalDescription description )
            throws Exception
    {
        Traverser traverser = description.uniqueness(
                Uniqueness.NODE_PATH ).traverse( referenceNode() );


        expectPaths( traverser, NODE_UNIQUE_PATHS );
    }

View Full Code Here

    {
        Set<String> expected = new HashSet<String>(
                Arrays.asList( NODE_UNIQUE_PATHS ) );
        expected.addAll( Arrays.asList( RELATIONSHIP_UNIQUE_EXTRA_PATHS ) );


        Traverser traverser = description.uniqueness(
                Uniqueness.RELATIONSHIP_PATH ).traverse( referenceNode() );


        expectPaths( traverser, expected );
    }

View Full Code Here

        canPruneTraversalAtSpecificDepth( Traversal.description().breadthFirst() );
    }


    private void canPruneTraversalAtSpecificDepth( TraversalDescription description )
    {
        Traverser traverser = description.uniqueness(
                Uniqueness.NONE ).evaluator( Evaluators.toDepth( 1 ) ).traverse( referenceNode() );


        expectNodes( traverser, "1", "2", "3", "4", "5" );
    }

View Full Code Here

        canPreFilterNodes( Traversal.description().breadthFirst() );
    }


    private void canPreFilterNodes( TraversalDescription description )
    {
        Traverser traverser = description.uniqueness(
                Uniqueness.NONE ).evaluator( Evaluators.atDepth( 2 ) ).traverse( referenceNode() );


        expectPaths( traverser, "1,2,6", "1,3,5", "1,4,5", "1,5,3", "1,5,4",
                "1,5,6" );
    }

View Full Code Here

    }


    @Test
    public void nodesIteratorReturnAllNodes() throws Exception
    {
        Traverser traverser = Traversal.description().traverse( referenceNode() );
        int count = 0;
        for ( Node node : traverser.nodes() )
        {
            assertNotNull( "returned nodes should not be null. node #"
                           + count, node );
            count++;
        }

View Full Code Here

0 1 2 3

TOP

Related Classes of org.neo4j.graphdb.traversal.Traverser

com.springone.myrestaurants.domain.TopRatedRestaurantFinder

ie.transportdublin.graphalgo.Dijkstra

org.neo4j.examples.imdb.util.SimplePathFinder

org.neo4j.graphalgo.impl.path.Dijkstra

org.neo4j.graphalgo.impl.path.ExactDepthPathFinder

org.neo4j.graphalgo.impl.path.ExperimentalAStar

org.neo4j.kernel.impl.traversal.DepthPitfallGraphTest

org.neo4j.kernel.impl.traversal.SmallestGraphEverTest

org.neo4j.kernel.impl.traversal.TreeGraphTest

org.neo4j.rest.graphdb.MatrixDatabaseRestTest

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.