adiar::statistics::nested_sweeping_t::inner_up_t Struct Reference

Inner Up Sweep(s) More...

#include <adiar/statistics.h>

Inheritance diagram for adiar::statistics::nested_sweeping_t::inner_up_t:

Collaboration diagram for adiar::statistics::nested_sweeping_t::inner_up_t:

Public Attributes
uintwide	inner_arcs = 0
	Number of arcs within inner sweep.
uintwide	outer_arcs = 0
	Number of arcs within outer sweep.
uintwide	reduced_levels = 0
	Number of levels reduced canonically.
uintwide	reduced_levels__fast = 0
	Number of levels reduced "fast" and non-canonically.
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. "

Detailed Description

Inner Up Sweep(s)

Member Data Documentation

lpq

adiar::statistics::__alg_base::__lpq_t adiar::statistics::__alg_base::lpq

inherited

---

The documentation for this struct was generated from the following file:

• /home/runner/work/adiar/adiar/src/adiar/statistics.h