Compute the (reduced) set of children of node i in this graph.
Declared in <cluster_linearize.h>
SetType
GetReducedChildren(DepGraphIndex i) const noexcept;This returns the minimal subset of the children of i whose descendants together equal all of i's descendants (unless i is part of a cycle of dependencies). Note that DepGraph does not store the set of children; this information is inferred from the descendant sets.
Complexity: O(N) where N=Descendants(i).Count() (which is bounded by TxCount()).
The minimal set of direct children of i.
| Name | Description |
|---|---|
| i | The transaction whose reduced children to compute. |