(BloomFilterDeBruijnGraph graph, Kmer source, int lookahead, int bound)
| 1959 | } |
| 1960 | |
| 1961 | public static ArrayDeque<Kmer> greedyExtendRight(BloomFilterDeBruijnGraph graph, Kmer source, int lookahead, int bound) { |
| 1962 | ArrayDeque<Kmer> extension = new ArrayDeque<>(bound); |
| 1963 | |
| 1964 | Kmer nextKmer = source; |
| 1965 | for (int i=0; i<bound; ++i) { |
| 1966 | nextKmer = greedyExtendRightOnce(graph, nextKmer, lookahead); |
| 1967 | |
| 1968 | if (nextKmer == null) { |
| 1969 | break; |
| 1970 | } |
| 1971 | |
| 1972 | extension.addLast(nextKmer); |
| 1973 | } |
| 1974 | |
| 1975 | return extension; |
| 1976 | } |
| 1977 | |
| 1978 | public static ArrayDeque<Kmer> greedyExtendRight(final BloomFilterDeBruijnGraph graph, |
| 1979 | final Kmer source, |
no test coverage detected