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 relationshipsIteratorReturnAllNodes() throws Exception
    {
        Traverser traverser = Traversal.description().traverse( referenceNode() );
        int count = 0;
        for ( Relationship relationship : traverser.relationships() )
        {
            assertNotNull(
                    "returned relationships should not be. relationship #"
                            + count, relationship );
            count++;

View Full Code Here

    }


    @Test
    public void pathsIteratorReturnAllNodes() throws Exception
    {
        Traverser traverser = Traversal.description().traverse( referenceNode() );
        int count = 0;
        for ( Path path : traverser )
        {
            assertNotNull( "returned paths should not be null. path #"
                           + count, path );

View Full Code Here

    }


    @Test
    public void testBreadthFirst() throws Exception
    {
        Traverser traverser = Traversal.description().breadthFirst().traverse(
                referenceNode() );
        Stack<Set<String>> levels = new Stack<Set<String>>();
        levels.push( new HashSet<String>( Arrays.asList( "5", "6", "7", "8",
                "9", "A", "B", "C", "D" ) ) );
        levels.push( new HashSet<String>( Arrays.asList( "2", "3", "4" ) ) );

View Full Code Here


    @Test
    public void testDepthFirstTraversalReturnsNodesOnCorrectDepths()
            throws Exception
    {
        Traverser traverser = Traversal.description().depthFirst().traverse(
                referenceNode() );
        int i = 0;
        for ( Path pos : traverser )
        {
            assertEquals( expectedDepth( i++ ), pos.length() );

View Full Code Here

    }


    @Test
    public void testPostorderDepthFirstReturnsDeeperNodesFirst()
    {
        Traverser traverser = Traversal.description().order(
                Traversal.postorderDepthFirst() ).traverse(
                        referenceNode() );
        int i = 0;
        List<String> encounteredNodes = new ArrayList<String>();
        for ( Path pos : traverser )

View Full Code Here

    }


    @Test
    public void testPostorderBreadthFirstReturnsDeeperNodesFirst()
    {
        Traverser traverser = Traversal.description().order(
                Traversal.postorderBreadthFirst() ).traverse( referenceNode() );
        Stack<Set<String>> levels = new Stack<Set<String>>();
        levels.push( new HashSet<String>( Arrays.asList( "1" ) ) );
        levels.push( new HashSet<String>( Arrays.asList( "2", "3", "4" ) ) );
        levels.push( new HashSet<String>( Arrays.asList( "5", "6", "7", "8",

View Full Code Here

        final TraversalDescription traversalDescription = new TraversalDescriptionImpl()
                .order(Traversal.postorderBreadthFirst())
                .prune(Traversal.pruneAfterDepth(MAXIMUM_DEPTH))
                .filter(calculateRatingPredicate)
                .relationships(DynamicRelationshipType.withName("friends"));
        final Traverser traverser = traversalDescription.traverse(userNode);
        final Iterator<Node> it = traverser.nodes().iterator();
        while (it.hasNext()) {
            it.next();
        }
        return calculateRatingPredicate.getRecommendedRestaurants(n);
    }

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.