Searched refs:inDegree (Results 1 – 2 of 2) sorted by relevance
248 size_t inDegree {0}; member251 …FilterNode(size_t degree, Filter* f, std::vector<size_t> next) : inDegree(degree), filter(f), next… in FilterNode()286 graph[idx].inDegree--; in ReorderFilters()287 if (graph[idx].inDegree == 0) { in ReorderFilters()
514 std::vector<int> inDegree(size, 0); // save in-degree of every point in IsCircularDependency() local518 inDegree[dependency[i][1]]++; in IsCircularDependency()521 for (size_t i = 0; i < inDegree.size(); i++) { in IsCircularDependency()522 if (inDegree[i] == 0) { in IsCircularDependency()533 inDegree[j]--; in IsCircularDependency()534 if (inDegree[j] == 0) { in IsCircularDependency()