Calculemus


bdd Type

The type of Binary Decision Diagram.

It is composed by

  • a unique table func<bddnode, int>: a finite partial function mapping a bddnode to an integer index;
  • an expansion table func<int, bddnode>: a finite partial function mapping an integer index to a bddnode;
  • an integer to store the smallest unused positive node index;
  • a prop variable order (prop -> prop -> bool);

Union cases

Union case Description

Bdd(func<bddnode, int> * func<int, bddnode> * int, prop -> prop -> bool)

Full Usage: Bdd(func<bddnode, int> * func<int, bddnode> * int, prop -> prop -> bool)

Parameters:
Item1 : func<bddnode, int> * func<int, bddnode> * int
Item2 : prop -> prop -> bool