Expand description
A crate implementing different omnitig-related algorithms.
Re-exports§
pub use traitgraph;
Modules§
- hamiltonian
- Preprocess a hamiltonian circuit problem using node-centric omnitigs.
- hydrostructure
- Algorithms to compute the hydrostructure.
- macrotigs
- Algorithms to compute macrotigs.
- node_
covering_ node_ visible_ multi_ circular_ safe - Algorithms to compute maximal safe walks under the node-covering node-visible multi-circular walk model.
- node_
covering_ node_ visible_ one_ circular_ safe - Algorithms to compute maximal safe walks under the node-covering node-visible 1-circular walk model.
- omnitigs
- Algorithms to extract omnitigs from a graph.
- restricted_
reachability - Algorithms related to restricted reachability queries, like our basic: given an edge e, return everything reachable from the tail of e without using e.
- unitigs
- Algorithms to compute unitigs.
- walks
- Core functions on walks for omnitig-like algorithms.