Searched refs:root_set (Results 1 – 5 of 5) sorted by relevance
34 void ParallelPreorderTraversal(const std::vector<Cell*>& root_set);73 std::vector<Cell*> root_set; in main() local74 g.get_root_set(root_set); in main()75 root_set_size = root_set.size(); in main()77 ParallelPreorderTraversal(root_set); in main()
49 void ParallelPreorderTraversal(const std::vector<Cell*>& root_set) { in ParallelPreorderTraversal() argument50 oneapi::tbb::parallel_for_each(root_set.begin(), root_set.end(), Body()); in ParallelPreorderTraversal()
63 void Graph::get_root_set(std::vector<Cell*>& root_set) { in get_root_set() argument67 root_set.clear(); in get_root_set()75 root_set.push_back(&my_vertex_set[k]); in get_root_set()
8 1. Compute the set of cells that have no inputs. This set is called `root_set`.10 3. Update each cell in `root_set`, by applying a `parallel_for_each` to a `root_set`.15 …mes printed are for the traversal and update, and do not include time for computing the `root_set`.
82 void get_root_set(std::vector<Cell*>& root_set);