(BloomFilterDeBruijnGraph graph, Kmer source, int lookahead, int bound)
| 1904 | } |
| 1905 | |
| 1906 | public static ArrayDeque<Kmer> greedyExtendLeft(BloomFilterDeBruijnGraph graph, Kmer source, int lookahead, int bound) { |
| 1907 | ArrayDeque<Kmer> extension = new ArrayDeque<>(bound); |
| 1908 | |
| 1909 | Kmer nextKmer = source; |
| 1910 | for (int i=0; i<bound; ++i) { |
| 1911 | nextKmer = greedyExtendLeftOnce(graph, nextKmer, lookahead); |
| 1912 | |
| 1913 | if (nextKmer == null) { |
| 1914 | break; |
| 1915 | } |
| 1916 | |
| 1917 | extension.addFirst(nextKmer); |
| 1918 | } |
| 1919 | |
| 1920 | return extension; |
| 1921 | } |
| 1922 | |
| 1923 | public static ArrayDeque<Kmer> greedyExtendLeftReversed(BloomFilterDeBruijnGraph graph, Kmer source, int lookahead, int bound) { |
| 1924 | ArrayDeque<Kmer> extension = new ArrayDeque<>(bound); |
no test coverage detected