Expand description
An algorithm to extract the maximal node-centric trivial omnitigs.
Structs
- An algorithm to extract trivial omnitigs.
Type Definitions
- An algorithm to extract trivial omnitigs form a not strongly connected graph. This runs slightly slower than the counterpart for strongly connected graphs, especially for long univocal extensions.
- An algorithm to extract trivial omnitigs form a strongly connected graph.