Module omnitigs::macrotigs::macronodes

Algorithms and structures to compute and store macronodes.

Modules

• strongly_connected_macronode_algorithm
  A macronode algorithm that requires the graph to be strongly connected.

Structs

• Macronodes
  A struct containing the macronodes of an uncompressed graph, represented as walks through their uncompressed centers. In an uncompressed graph, macronode centers are maximal unitigs with the property that their first node has outdegree = 1, and their last node has indegree = 1.

Traits

• MacronodeAlgorithm
  A trait abstracting over the concrete algorithm used to compute macronodes.