Examples of org.neo4j.graphalgo.impl.path.ExactDepthPathFinder

org.neo4j.graphalgo.impl.path.ExactDepthPathFinder

Tries to find paths in a graph from a start node to an end node where the length of found paths must be of a certain length. It also detects "super nodes", i.e. nodes which have many relationships and only iterates over such super nodes' relationships up to a supplied threshold. When that threshold is reached such nodes are considered super nodes and are put on a queue for later traversal. This makes it possible to find paths w/o having to traverse heavy super nodes. @author Mattias Persson @author Tobias Ivarsson

        graph.makeEdgeChain( "SOURCE,z,9,0,TARGET" );
    }
    
    private PathFinder<Path> newFinder()
    {
        return new ExactDepthPathFinder( Traversal.expanderForAllTypes(), 4, 4 );
    }

Examples of org.neo4j.graphalgo.impl.path.ExactDepthPathFinder

Related Classes of org.neo4j.graphalgo.impl.path.ExactDepthPathFinder