Expand description

A crate implementing different omnitig-related algorithms.


pub use traitgraph;


Preprocess a hamiltonian circuit problem using node-centric omnitigs.

Algorithms to compute the hydrostructure.

Algorithms to compute macrotigs.

Algorithms to compute maximal safe walks under the node-covering node-visible 1-circular walk model.

Algorithms to extract omnitigs from a graph.

Algorithms related to restricted reachability queries, like our basic: given an edge e, return everything reachable from the tail of e without using e.

Algorithms to compute unitigs.

Core functions on walks for omnitig-like algorithms.