Thomas E. Allen's Code to Generate CP-nets Uniformly at Random

We provide a novel algorithm for provably generating acyclic CP-nets uniformly at random. Our method is computationally efficient and allows for multi-valued domains and arbitrary bounds on the indegree in the dependency graph.

Code

Documentation