Examples of LiteDepthFirstSelector

org.neo4j.graphalgo.impl.util.LiteDepthFirstSelector
A preorder depth first selector which detects "super nodes", i.e. nodes which has many relationships. It delays traversing those super nodes until after all non-super nodes have been traversed. @author Mattias Persson @author Tobias Ivarsson

Examples of org.neo4j.graphalgo.impl.util.LiteDepthFirstSelector

                Uniqueness.RELATIONSHIP_PATH ).order(
                new BranchOrderingPolicy()
                {
                    public BranchSelector create( TraversalBranch startSource )
                    {
                        return new LiteDepthFirstSelector( startSource,
                                startThreshold );
                    }
                } );
        final int firstHalf = onDepth / 2;
        Traverser startTraverser = base.prune(

View Full Code Here

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.