[#cluster_linearize-DepGraph-GetReducedChildren]
= xref:cluster_linearize.adoc[cluster_linearize]::xref:cluster_linearize/DepGraph.adoc[DepGraph]::GetReducedChildren
:relfileprefix: ../../
:mrdocs:

Compute the (reduced) set of children of node i in this graph.

== Synopsis

Declared in `<cluster_linearize.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
SetType
GetReducedChildren(xref:cluster_linearize/DepGraphIndex.adoc[DepGraphIndex] i) const noexcept;
----

== Description

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()).

== Return Value

The minimal set of direct children of i.

== Parameters

[cols="1,4"]
|===
| Name| Description
| *i*
| The transaction whose reduced children to compute.
|===


[.small]#Created with https://www.mrdocs.com[MrDocs]#