Expand description
The transitive closure of the is-a hierarchy.
Computed once, offline, by a bitset sweep in topological order: a node’s ancestor set is the union of its parents’ ancestor sets plus the parents themselves; descendants are the same sweep over the transposed adjacency. A cycle in the is-a edges is a defect in the input and is refused. Roaring bitmaps keep the sets small and iterate in sorted order, which keeps every consumer deterministic.
Structs§
- Closure
- The ancestor and descendant sets of every node.
Enums§
- Closure
Error - A failure while computing the closure.