Daniel@0: 
Daniel@0: %bnet = mk_uffe_dbn;
Daniel@0: bnet = mk_mildew_dbn;
Daniel@0: ss = length(bnet.intra);
Daniel@0: 
Daniel@0: % construct jtree from 1.5 slice DBN
Daniel@0: 
Daniel@0: int = compute_fwd_interface(bnet.intra, bnet.inter);
Daniel@0: bnet15 = mk_slice_and_half_dbn(bnet, int);
Daniel@0: 
Daniel@0: % use unconstrained elimination,
Daniel@0: % but force there to be a clique containing both interfaces
Daniel@0: clusters = {int, int+ss};
Daniel@0: jtree_engine = jtree_inf_engine(bnet15, 'clusters', clusters, 'root', int+ss);
Daniel@0: S=struct(jtree_engine)
Daniel@0: in_clq = clq_containing_nodes(jtree_engine, int);
Daniel@0: out_clq = clq_containing_nodes(jtree_engine, int+ss)
Daniel@0: 
Daniel@0: 
Daniel@0: % Also make a jtree from slice 1
Daniel@0: bnet1 = mk_bnet(bnet.intra1, bnet.node_sizes_slice);
Daniel@0: jtree_engine1 = jtree_inf_engine(bnet1, 'clusters', {int}, 'root', int);
Daniel@0: S1=struct(jtree_engine1)