(BloomFilterDeBruijnGraph graph, Kmer source, int lookahead, int bound)
| 1921 | } |
| 1922 | |
| 1923 | public static ArrayDeque<Kmer> greedyExtendLeftReversed(BloomFilterDeBruijnGraph graph, Kmer source, int lookahead, int bound) { |
| 1924 | ArrayDeque<Kmer> extension = new ArrayDeque<>(bound); |
| 1925 | |
| 1926 | Kmer nextKmer = source; |
| 1927 | for (int i=0; i<bound; ++i) { |
| 1928 | nextKmer = greedyExtendLeftOnce(graph, nextKmer, lookahead); |
| 1929 | |
| 1930 | if (nextKmer == null) { |
| 1931 | break; |
| 1932 | } |
| 1933 | |
| 1934 | extension.addLast(nextKmer); |
| 1935 | } |
| 1936 | |
| 1937 | return extension; |
| 1938 | } |
| 1939 | |
| 1940 | public static ArrayDeque<Kmer> greedyExtendLeft(final BloomFilterDeBruijnGraph graph, |
| 1941 | final Kmer source, |
nothing calls this directly
no test coverage detected