Method GetReducedChildren

src/cluster_linearize.h:232–243

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

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

    /** Compute the aggregate feerate of a set of nodes in this graph.
     *