Zero-suppressed Decision Diagrams

A Zero-suppressed Decision Diagram (ZDD) represents a family of a set of \( n \) numbers, i.e. an \( S \subseteq 2^{\{ 0, 1, \dots, n-1 \}} \). More...

Collaboration diagram for Zero-suppressed Decision Diagrams:

Modules
	Basic Constructors
	Construction of constants, singletons, and points.
	Basic ZDD Operations
	Basic set operations.
	Predicates
	Predicative information on ZDDs.
	Counting Operations
	Numerical information on ZDDs.
	Set Elements
	Information on the elements in ZDDs.
	Conversion to ZDDs
	Conversion from Binary Decision Diagrams .
	ZDD Visualization
	Printing of .dot files.

Classes
class	adiar::__zdd
	A (possibly unreduced) Zero-suppressed Decision Diagram. More...
class	adiar::zdd
	Reduced Ordered Zero-suppressed Decision Diagram. More...

Detailed Description

A Zero-suppressed Decision Diagram (ZDD) represents a family of a set of \( n \) numbers, i.e. an \( S \subseteq 2^{\{ 0, 1, \dots, n-1 \}} \).

The zdd class takes care of reference counting and optimal garbage collection of the underlying files. To ensure the most disk-space is available, try to garbage collect the zdd objects as quickly as possible and/or minimise the number of lvalues of said type.

An exec_policy can be provided as an optional first argument for (most) of the ZDD functions. This provides you with the ability to change settings on the algorithm execution, e.g. the type of priority queue and algorithm used.