Examples of Traverser

com.google.enterprise.connector.traversal.Traverser
Interface presented by a Traverser. Used by the Scheduler.
com.tinkerpop.gremlin.process.Traverser
driguez.com)

org.codehaus.janino.util.Traverser

This class traverses the subnodes of an AST. Derived classes may override individual methods to process specific nodes, e.g.:

 LocalClassDeclaration lcd = ...; lcd.accept(new Traverser() { int n = 0; public void traverseMethodDeclarator(Java.MethodDeclarator md) { ++this.n; super.traverseMethodDeclarator(md); } }.comprehensiveVisitor());

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
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.

Examples of org.neo4j.graphdb.Traverser

                }
            }
        };


        // 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

Examples of org.neo4j.graphdb.Traverser

                }
            }
        };


        // 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

Examples of org.neo4j.graphdb.Traverser

                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

Examples of org.neo4j.graphdb.Traverser

                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

Examples of org.neo4j.graphdb.Traverser

                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

Examples of org.neo4j.graphdb.traversal.Traverser

        TraversalDescription traversalDescription = new TraversalDescriptionImpl()
                .order(Traversal.postorderBreadthFirst())
                .prune(Traversal.pruneAfterDepth(MAXIMUM_DEPTH))
                .filter(returnEval)
                .expand(Traversal.expanderForTypes(relType, Direction.BOTH));
        final Traverser traverser = traversalDescription
                .traverse(startNode);
        return traverser.nodes().iterator();
    }

View Full Code Here

Examples of org.neo4j.graphdb.traversal.Traverser

    @Test
    public void testTraverseToNeighbour() {
        final Relationship rel = relationship();
        final TraversalDescription traversalDescription = RestTraversal.description().maxDepth(1).breadthFirst();
        System.out.println("traversalDescription = " + traversalDescription);
        final Traverser traverser = traversalDescription.traverse(rel.getStartNode());
        final Iterable<Node> nodes = traverser.nodes();
        Assert.assertEquals(rel.getEndNode(), nodes.iterator().next());
    }

View Full Code Here

Examples of org.neo4j.graphdb.traversal.Traverser

                return ( path.endNode().equals( end ) ? Evaluation.INCLUDE_AND_PRUNE
                        : Evaluation.EXCLUDE_AND_CONTINUE );
            }
        };


        final Traverser traverser = TRAVERSAL.expand( expander ).order(
                new SelectorFactory( costEvaluator, time ) ).evaluator(
                evaluator ).traverse( start );


        return new Iterable<WeightedPath>()
        {
            public Iterator<WeightedPath> iterator()
            {
                return new StopAfterWeightIterator( traverser.iterator(), costEvaluator );
            }
        };
    }

View Full Code Here

Examples of org.neo4j.graphdb.traversal.Traverser

    @Test
    public void testTraverseToNeighbour() {
        final Relationship rel = relationship();
        final TraversalDescription traversalDescription = RestTraversal.description().maxDepth(1).breadthFirst();
        System.out.println("traversalDescription = " + traversalDescription);
        final Traverser traverser = traversalDescription.traverse(rel.getStartNode());
        final Iterable<Node> nodes = traverser.nodes();
        Assert.assertEquals(rel.getEndNode(), nodes.iterator().next());
    }

View Full Code Here

Examples of org.neo4j.graphdb.traversal.Traverser

       */
      @Test
      public void getNeoFriends() throws Exception {
          Node neoNode = restmdg.getNeoNode(); 
          System.out.println(neoNode.getProperty("name"));
          Traverser friendsTraverser = getFriends( neoNode );         
          int numberOfFriends = 0;              
          for ( Path friendPath : friendsTraverser ) {               
              numberOfFriends++;                 
          }

View Full Code Here

0 1 2 3 4 5

TOP

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.