Method GetReducedParents

src/cluster_linearize.h:211–222

Compute the (reduced) set of parents of node i in this graph. * * 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).

     * Complexity: O(N) where N=Ancestors(i).Count() (which is bounded by TxCount()).
     */
    SetType GetReducedParents(DepGraphIndex i) const noexcept
    {
        SetType parents = Ancestors(i);
        parents.Reset(i);
        for (auto parent : parents) {
            if (parents[parent]) {
                parents -= Ancestors(parent);
                parents.Set(parent);
            }
        }
        return parents;
    }

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