void ctkDependencyGraphPrivate::subgraphSizeRec(int rootId, QSet<int>& uniqueVertices) { Q_ASSERT(rootId > 0); for (int i = 0; i < this->OutDegree[rootId]; ++i) { int child = this->edge(rootId, i); uniqueVertices << child; subgraphSizeRec(child, uniqueVertices); } }
//---------------------------------------------------------------------------- void ctkDependencyGraphPrivate::subgraphSizeRec(int rootId, std::set<int>& uniqueVertices) { assert(rootId > 0); for (int i = 0; i < this->OutDegree[rootId]; ++i) { int child = this->edge(rootId, i); uniqueVertices.insert(child); subgraphSizeRec(child, uniqueVertices); } }