Expand description
Functions and structures related to univocal traversals. Univocal traversals are traversals along unique out-edges or unique in-edges in a graph.
Structs§
- Univocal
Iterator - An iterator over the univocal extension of a node or edge.
The direction is defined by the
NeighborStrategy
.
Functions§
- is_
edge_ self_ bivalent - Returns true if the given edge is self-bivalent in the given graph, i.e. its univocal extension repeats a node.