Structs§
- Dbg
- Canonical de Bruijn graph: nodes are canonical (k-1)-mers; each input
k-mer contributes one edge
prefix(k-1) → suffix(k-1). Storing nodes in canonical form means a sequence and its reverse-complement share the same graph (matches megahit / spades defaults). - DbgNode