Method hasDepthLeft

src/rnabloom/util/GraphUtils.java:6705–6728

(Kmer source, BloomFilterDeBruijnGraph graph, int depth)

    }
    
    public static boolean hasDepthLeft(Kmer source, BloomFilterDeBruijnGraph graph, int depth) {
        int k = graph.getK();
        int numHash = graph.getMaxNumHash();
        
        ArrayDeque<ArrayDeque<Kmer>> frontier = new ArrayDeque<>();
        ArrayDeque<Kmer> alts = source.getPredecessors(k, numHash, graph);
        frontier.add(alts);
        
        while (!frontier.isEmpty()) {
            alts = frontier.peekLast();
            if (alts.isEmpty()) {
                frontier.removeLast();
            }
            else {
                frontier.add(alts.pop().getPredecessors(k, numHash, graph));
            }

            if (frontier.size() >= depth) {
                return true;
            }
        }
        
        return false;
    }
    
    public static boolean hasDepthRight(Kmer source, BloomFilterDeBruijnGraph graph, int depth, BloomFilter bf) {
        int k = graph.getK();