| Algorithm 5: Connected |
| Input: k-mer[i], k-mer[j] Output: connected BEGIN connected <- FALSE if k-mer[i].first < k-mer[j].first AND k-mer[i].last == k-mer[j].last OR k-mer[i].first == (k-mer[j].last + 1) then connected <- TRUE END |
| Algorithm 5: Connected |
| Input: k-mer[i], k-mer[j] Output: connected BEGIN connected <- FALSE if k-mer[i].first < k-mer[j].first AND k-mer[i].last == k-mer[j].last OR k-mer[i].first == (k-mer[j].last + 1) then connected <- TRUE END |