iterative correction, starting at first k-length with sparsity, ending at first k-length with no updates (possibly better terminating conditions, should look into that)
write graph out as GFA (try compacted and raw)
to determine primary contigs using shortest path with L = (1 / total bases, where total bases = length * average depth or the actual lossless alignment calculation), or to start but with external dependencies, add try metaflye or https://github.com/lh3/minigraph
use primary contigs as reference for generating variant calls using ODGI -> VG flow, or possibly VG directly
algorithm: