Module graph 

Containers for path-compressed De Bruijn graphs

Structs

BaseGraph

A compressed DeBruijn graph carrying auxiliary data on each node of type D. This type does not carry the sorted index arrays the allow the graph to be walked efficiently. The DeBruijnGraph type wraps this type and add those vectors.

DebruijnGraph

A compressed DeBruijn graph carrying auxiliary data on each node of type D. The struct carries sorted index arrays the allow the graph to be walked efficiently.

EdgeIter

iterator over the edges of the de bruijn graph

IterComponents

Node

Unbranched sequence in the DeBruijn graph

NodeIntoIter

Iterator over nodes in a DeBruijnGraph

NodeIter

Iterator over nodes in a DeBruijnGraph

NodeKmer

A DebruijnGraph node with a reference to the sequence of the node.

NodeKmerIter

An iterator over the kmers in a DeBruijn graph node

PathCompIter

Enums

LadderState