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