[#cluster_linearize-DepGraph-GetReducedParents]
= xref:cluster_linearize.adoc[cluster&lowbar;linearize]::xref:cluster_linearize/DepGraph.adoc[DepGraph]::GetReducedParents
:relfileprefix: ../../
:mrdocs:

Compute the (reduced) set of parents of node i in this graph&period;

== Synopsis

Declared in `&lt;cluster&lowbar;linearize&period;h&gt;`

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

== Description

This returns the minimal subset of the parents of i whose ancestors together equal all of i&apos;s ancestors (unless i is part of a cycle of dependencies)&period; Note that DepGraph does not store the set of parents&semi; this information is inferred from the ancestor sets&period;

Complexity&colon; O(N) where N&equals;Ancestors(i)&period;Count() (which is bounded by TxCount())&period;

== Return Value

The minimal set of direct parents of i&period;

== Parameters

[cols="1,4"]
|===
| Name| Description
| *i*
| The transaction whose reduced parents to compute&period;
|===


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