Package org.neo4j.graphdb.traversal

Examples of org.neo4j.graphdb.traversal.Traverser

146
147
148
149
150
151
152
153
           @Test
           public void compareIndexAndTraversal() throws Exception {
             IndexManager index = graphDb.index();            
             Index<Node> goodGuys = index.forNodes("heroes");
             IndexHits<Node> hits = goodGuys.query( "name", "*" );           
             Traverser heroesTraverser = getHeroes();              
               assertEquals( heroesTraverser.nodes().iterator().next().getId(), hits.iterator().next().getId() );
           }
View Full Code Here
153
154
155
156
157
158
159
160
161
           }
          
          
           @Test
           public void checkTraverseByProperties() throws Exception {       
               Traverser heroesTraverser = getHeroes();
               Traverser heroesTraverserByProperties = getHeroesByNodeProperties();
               assertEquals( heroesTraverser.nodes().iterator().next(), heroesTraverserByProperties.nodes().iterator().next() );
           }
View Full Code Here
211
212
213
214
215
216
217
218
219
220
221
            * @throws Exception
            */
           @Test
           public void findCypher() throws Exception{
             Node neoNode = mdg.getNeoNode();             
               Traverser friendsTraverser = getFriends( neoNode );
               boolean foundCypher = false;
               for ( Path friendPath : friendsTraverser ) {               
                 if (friendPath.endNode().getProperty("name").equals("Cypher")){
                   foundCypher = true;
                   break;
View Full Code Here
230
231
232
233
234
235
236
237
238
239
240
            */
           @Test
           public void getMatrixHackers() throws Exception
           {

                   Traverser traverser = findHackers( mdg.getNeoNode() );
                   int numberOfHackers = 0;
                   for ( Path hackerPath : traverser ) {
                       numberOfHackers++;
                   }
                   assertEquals( 1, numberOfHackers );
View Full Code Here
31
32
33
34
35
36
37
38
39
    @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
29
30
31
32
33
34
35
36
37
38
39
40
        final TraversalDescription traversalDescription = new TraversalDescriptionImpl()
                .order(Traversal.postorderBreadthFirst())
                .evaluator(Evaluators.toDepth(MAXIMUM_DEPTH))
                .evaluator(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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
                        return new LiteDepthFirstSelector( startSource,
                                startThreshold );
                    }
                } );
        final int firstHalf = onDepth / 2;
        Traverser startTraverser = base.prune(
                Traversal.pruneAfterDepth( firstHalf ) ).expand(
                expander ).filter( new Predicate<Path>()
        {
            public boolean accept( Path item )
            {
                return item.length() == firstHalf;
            }
        } ).traverse( start );
        final int secondHalf = onDepth - firstHalf;
        Traverser endTraverser = base.prune(
                Traversal.pruneAfterDepth( secondHalf ) ).expand(
                expander.reversed() ).filter( new Predicate<Path>()
        {
            public boolean accept( Path item )
            {
                return item.length() == secondHalf;
            }
        } ).traverse( end );

        final Iterator<Path> startIterator = startTraverser.iterator();
        final Iterator<Path> endIterator = endTraverser.iterator();

        final Map<Node, Visit> visits = new HashMap<Node, Visit>();
        return new PrefetchingIterator<Path>()
        {
            @Override
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
            {
                return position.endNode().equals( end );
            }
        };

        final Traverser traverser = traversalDescription.order(
                new SelectorFactory( end ) ).filter( filter ).traverse( start );
        return new Iterable<WeightedPath>()
        {
            public Iterator<WeightedPath> iterator()
            {
                return new StopAfterWeightIterator( traverser.iterator(),
                        costEvaluator );
            }
        };
    }
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
            {
                return position.endNode().equals( end );
            }
        };

        final Traverser traverser = TRAVERSAL.expand( expander ).order(
                new SelectorFactory( costEvaluator ) ).filter( filter ).traverse( start );
        return new Iterable<WeightedPath>()
        {
            public Iterator<WeightedPath> iterator()
            {
                return new StopAfterWeightIterator( traverser.iterator(),
                        costEvaluator );
            }
        };
    }
View Full Code Here
123
124
125
126
127
128
129
130
131
        execute( Traversal.description().breadthFirst(), Uniqueness.RELATIONSHIP_RECENT );
    }

    private void execute( TraversalDescription traversal, Uniqueness uniqueness )
    {
        Traverser traverser = traversal.uniqueness( uniqueness ).traverse(
                referenceNode() );
        assertFalse( "empty traversal", IteratorUtil.count( traverser ) == 0 );
    }
View Full Code Here
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
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.