Method isBranchFree

src/rnabloom/util/GraphUtils.java:7651–7672

(Collection<Kmer> seqKmers, BloomFilterDeBruijnGraph graph, int maxTipLength)

    }
    
    public static boolean isBranchFree(Collection<Kmer> seqKmers, BloomFilterDeBruijnGraph graph, int maxTipLength) {
        int k = graph.getK();
        int numHash = graph.getMaxNumHash();
        
        for (Kmer kmer : seqKmers) {
            for (Kmer var : kmer.getRightVariants(k, numHash, graph)) {
//                if (hasDepthRight(var, graph, maxTipLength)) {
                if (var.hasDepthRight(k, numHash, graph, maxTipLength)) {
                    return false;
                }
            }
            
            for (Kmer var : kmer.getLeftVariants(k, numHash, graph)) {
//                if (hasDepthLeft(var, graph, maxTipLength)) {
                if (var.hasDepthLeft(k, numHash, graph, maxTipLength)) {
                    return false;
                }
            }
        }
        
        return true;
    }
    
    public static boolean isChimera(ArrayList<Kmer> seqKmers, BloomFilterDeBruijnGraph graph, BloomFilter assembledKmers, int lookahead) {
        int k = graph.getK();