In jordagaman/zddr: A zero-suppressed binary decision diagram implementation for R

knitr::opts_chunk$set(
  collapse = TRUE,
  comment = "#>"
)
# use this space to clear out the annoying pryr message
library(zddr)
zdd(1)
reset_zdd_store()

library(zddr)

Terminal cases

The first insight into the underlying algorithms is an examination of how each function handles the terminal cases. The terminal cases are:

• Operation of a ZDD to itself
• Operation of a ZDD to the zero-node (and vice-versa)
• Operation of a ZDD to the one-node (and vice-versa)

Union

zdd(4) | zdd(4)
zdd(4) | F
zdd(4) | T
as_zdd(F) | zdd(4)
as_zdd(T) | zdd(4)

Difference

zdd(4) - zdd(4)
zdd(4) - F
zdd(4) - T
as_zdd(F) - zdd(4)
as_zdd(T) - zdd(4)

Intersection

zdd(4) & zdd(4)
zdd(4) & F
zdd(4) & T
as_zdd(F) & zdd(4)
as_zdd(T) & zdd(4)

Crossproduct

zdd(4) * zdd(4)
zdd(4) * F
zdd(4) * T
as_zdd(F) * zdd(4)
as_zdd(T) * zdd(4)

AND-NOT

zdd(4) %% zdd(4)
zdd(4) %% F
zdd(4) %% T
as_zdd(F) %% zdd(4)
as_zdd(T) %% zdd(4)

jordagaman/zddr documentation built on June 29, 2021, 4:23 a.m.