Package org.neo4j.graphdb.traversal

Examples of org.neo4j.graphdb.traversal.TraversalBranch

59
60
61
62
63
64
65
66
67
68
69
70
71
72
        public TraversalBranch next()
        {
            // Exhaust current if not already exhausted
            while ( true )
            {
                TraversalBranch next = current.next();
                if ( next != null )
                {
                    if ( !visitedNodes.contains( next.node().getId() ) )
                    {
                        // Adding the path weight for usage by the WaitingTimeCostEvaluator
                        P newPriority = addPriority( next,
                                currentAggregatedValue,
                                calculateValue( next, currentAggregatedValue ) );
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
        this.threshold = startThreshold;
    }
   
    public TraversalBranch next()
    {
        TraversalBranch result = null;
        while ( result == null )
        {
            if ( current == null )
            {
                current = superNodes.poll();
                if ( current == null )
                {
                    return null;
                }
            }
            else if ( current.expanded() > 0 && current.expanded() % threshold == 0 )
            {
                superNodes.add( current );
                current = current.parent();
                continue;
            }
           
            TraversalBranch next = current.next();
            if ( next == null )
            {
                current = current.parent();
                continue;
            }
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
67
68
69
        public TraversalBranch next()
        {
            // Exhaust current if not already exhausted
            while ( true )
            {
                TraversalBranch next = current.next();
                if ( next != null )
                {
                    if ( !visitedNodes.contains( next.node().getId() ) )
                    {
                        P newPriority = addPriority( next, currentAggregatedValue,
                                calculateValue( next ) );
                        queue.put( next, newPriority );
                    }
View Full Code Here
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
        this.current = startSource;
    }
   
    public TraversalBranch next()
    {
        TraversalBranch result = null;
        while ( result == null )
        {
            if ( current == null )
            {
                return null;
            }
           
            TraversalBranch next = current.next();
            if ( next != null )
            {
                current = next;
            }
            else
View Full Code Here
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
        }

        @Override
        protected Path fetchNextOrNull()
        {
            TraversalBranch result = null;
            while ( true )
            {
                result = sourceSelector.next();
                if ( result == null )
                {
                    return null;
                }
                if ( result.evaluation().includes() )
                {
                    return result.position();
                }
            }
        }
View Full Code Here
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
            {
                continue;
            }
            expandedCount++;
            Node node = relationship.getOtherNode( source );
            TraversalBranch next = new TraversalBranchImpl( traverser, this, depth + 1, node,
                    traverser.description.expander, relationship );
            if ( traverser.okToProceed( next ) )
            {
                next.initialize();
                return next;
            }
        }
        return null;
    }
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
            // because even if there would be a situation where two (or more)
            // threads comes here at the same time everything would still
            // work as expected (in here as well as outside).
            LinkedList<Node> nodesList = new LinkedList<Node>();
            LinkedList<Relationship> relationshipsList = new LinkedList<Relationship>();
            TraversalBranch stepper = branch;
            while ( stepper != null )
            {
                nodesList.addFirst( stepper.node() );
                Relationship relationship = stepper.relationship();
                if (relationship != null)
                {
                    relationshipsList.addFirst( relationship );
                }
                stepper = stepper.parent();
            }
            nodes = nodesList;
            relationships = relationshipsList;
        }
    }
View Full Code Here
83
84
85
86
87
88
89
90
91
92
93
                break;
            }
           
            while ( true )
            {
                TraversalBranch next = source.next();
                if ( next == null )
                {
                    break;
                }
                level.add( next );
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
        this.current = startSource;
    }
   
    public TraversalBranch next()
    {
        TraversalBranch result = null;
        while ( result == null )
        {
            if ( current == null )
            {
                return null;
            }
            TraversalBranch next = current.next();
            if ( next == null )
            {
                current = current.parent();
                continue;
            }
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
51
52
53
        this.current = startSource;
    }

    public TraversalBranch next()
    {
        TraversalBranch result = null;
        while ( result == null )
        {
            TraversalBranch next = current.next();
            if ( next != null )
            {
                queue.add( next );
                result = next;
            }
View Full Code Here
TOP

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

  • com.springone.myrestaurants.domain.TopRatedRestaurantTraverser
  • ie.transportdublin.graphalgo.impl.BestFirstSelectorFactory$BestFirstSelector
  • org.neo4j.graphalgo.impl.util.BestFirstSelectorFactory$BestFirstSelector
  • org.neo4j.graphalgo.impl.util.LiteDepthFirstSelector
  • org.neo4j.kernel.impl.traversal.TraversalBranchImpl
  • org.neo4j.kernel.impl.traversal.TraversalPath
  • org.neo4j.kernel.impl.traversal.TraverserImpl$TraverserIterator
  • org.neo4j.kernel.PostorderBreadthFirstSelector
  • org.neo4j.kernel.PostorderDepthFirstSelector
  • org.neo4j.kernel.PreorderBreadthFirstSelector
    • 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.