The number of networks with the given node configuration.
Details
No arrows are allowed from continuous nodes to discrete nodes. Cycles
are not allowed. The
number of networks is given by B�ttcher (2002), using the result in
Robinson (1977).
When nd+nc>15, the procedure is quite slow.
References
B�ttcher, S.G. (2002). Learning Bayesian Networks with Mixed
Variables.
Robinson, R.W. (1977). Counting unlabeled acyclic digraphs, Lecture
Notes in Mathematics, 622: Combinatorial Mathematics.
Further information about Deal can be found at:
http://www.math.auc.dk/novo/deal.