Adiar
2.1.0
An External Memory Decision Diagram Library
|
Outer Reduce Sweep. More...
#include <adiar/statistics.h>
Public Attributes | |
uintwide | reduced_levels = 0 |
Number of levels reduced canonically. | |
uintwide | reduced_levels__fast = 0 |
Number of levels reduced "fast" and non-canonically. | |
uintwide | nested_levels = 0 |
Number Inner Sweeps started. | |
uintwide | skipped_nested_levels = 0 |
Number Inner Sweeps skipped. | |
uintwide | skipped_nested_levels__prune = 0 |
Number Inner Sweeps skipped that prunes all accumulated nodes. | |
uintwide | collapse_to_terminal = 0 |
Number of outer sweeps that collapsed early into a terminal. | |
uintwide | sum_node_arcs = 0 |
Sum of the inputs' number of arcs to internal nodes. | |
uintwide | sum_terminal_arcs = 0 |
Sum of the inputs' number of arcs to terminals. | |
uintwide | removed_by_rule_1 = 0 |
Number of nodes removed due to reduction rule 1, i.e. the number of nodes that are suppressed in the specific type of decision diagram. | |
uintwide | removed_by_rule_2 = 0 |
Number of nodes removed due to reduction rule 2, i.e. the number of duplicate of nodes that have been removed. | |
adiar::statistics::__alg_base::__lpq_t | lpq |
Type and usage of this algorithm's levelized priority queue. More... | |
Outer Reduce Sweep.
|
inherited |