Number of levels (ranges) of parallel VisitNode operations during post-order traversal.

uint num_levels() const;

During range-based post-order traversal, levels represent groups of nodes that can be visited independent from one another and, therefore, in parallel. In a balanced tree the number of levels is in the order of O(log2(N)), where N is the number of tips in the tree. Hence, parallelization can be efficient. In a strongly unbalanced tree, the number of levels is in the order of O(N), and the parallelization of the VisitNode operation cannot improve the speed.

See also

Tree OrderedTree num_parallel_ranges_prune

SPLITT

Other public methods in SPLITT::OrderedTree: SPLITT::OrderedTree::OrderedTree, SPLITT::OrderedTree::RangeIdPruneNode, SPLITT::OrderedTree::RangeIdVisitNode, SPLITT::OrderedTree::num_parallel_ranges_prune, SPLITT::OrderedTree::ranges_id_prune, SPLITT::OrderedTree::ranges_id_visit