Module omnitigs::omnitigs::univocal_extension_algorithms
source · Expand description
Different algorithms to compute univocal extensions.
Structs
- Computes the univocal extension of a walk assuming the graph is not strongly connected.
- Computes the univocal extension of a walk assuming the graph is not strongly connected.
- Computes the univocal extension of a walk assuming the graph is strongly connected. Might enter an infinite loop if the graph is not strongly connected.
- Computes the univocal extension of a walk assuming the graph is strongly connected. Might enter an infinite loop if the graph is not strongly connected.