OBDD.Linopt

Documentation

type Item v w = (w, [(v, Bool)])

linopt :: (Ord v, Num w, Ord w) => OBDD v -> Map v w -> Maybe (w, Map v Bool)

solve the constrained linear optimisation problem: returns an assignment that is a model of the BDD and maximises the sum of weights of variables.

fill :: (Ord v, Num w) => Map v w -> v -> Item v w -> Item v w

noadd :: (Ord v, Num w) => Map v w -> v -> Item v w -> Item v w

add :: (Ord v, Num w) => Map v w -> v -> Item v w -> Item v w