wolffd@0: function marginal = marginal_difclq_nodes(engine, query_nodes)
wolffd@0: % MARGINAL_DIFCLQ_NODES get the marginal distribution of nodes which is not in a single clique
wolffd@0: % marginal = marginal_difclq_nodes(engine, query_nodes)
wolffd@0: 
wolffd@0: keyboard
wolffd@0: num_clique = length(engine.cliques);
wolffd@0: B = engine.cliques_bitv;
wolffd@0: clqs_containnodes = [];
wolffd@0: for i=1:length(query_nodes)
wolffd@0:     node = query_nodes(i);
wolffd@0:     tnodes = find(all(B(:, node), 2));
wolffd@0:     clqs_containnodes = myunion(clqs_containnodes, tnodes);
wolffd@0: end
wolffd@0: % get all cliques contains query nodes
wolffd@0: 
wolffd@0: % get the minimal sub tree in junction which contains these cliques and the node closest to the root of jtree
wolffd@0: [subtree, nroot_node] = min_subtree_conti_nodes(engine.jtree, engine.root, clqs_containnodes);
wolffd@0: if ~mysubset(query_nodes, engine.cliques{nroot_node});
wolffd@0:     % if query nodes is not all memers of the clique closest to the root clique performe push operation
wolffd@0:     engine = push_tree(engine, subtree, query_nodes, nroot_node);
wolffd@0: end
wolffd@0: 
wolffd@0: if ~(nroot_node == engine.root)
wolffd@0:     % if the clique closest to the root clique is not the root clique we must direct combine the 
wolffd@0:     % potential with the potential stored in separator toward to root
wolffd@0:     p = parents(engine.jtree, nroot_node);
wolffd@0:     tpot = direct_combine_pots(engine.clpot{nroot_node}, engine.seppot{p, nroot_node});
wolffd@0: else
wolffd@0:     tpot = engine.clpot{nroot_node};
wolffd@0: end
wolffd@0: 
wolffd@0: pot = marginalize_pot(tpot, query_nodes);
wolffd@0: marginal = pot_to_marginal(pot);
wolffd@0: marginal.T = normalise(marginal.T);
wolffd@0: 
wolffd@0: 
wolffd@0: 
wolffd@0: function engine = push_tree(engine, tree, query_nodes, inode)
wolffd@0: % PUSH_TREE recursive perform push opeartion on tree
wolffd@0: % engine = push_tree(engine, tree, query_nodes, inode)
wolffd@0: 
wolffd@0: cs = children(tree, inode);
wolffd@0: for i = 1:length(cs)
wolffd@0:     node = cs(i);
wolffd@0:     push_tree(engine, tree, query_nodes, node);
wolffd@0:     push_dom = myintersect(engine.cliques{node}, query_nodes);
wolffd@0:     [engine, clqtoroot] = push(engine, node, push_dom);
wolffd@0: end
wolffd@0: 
wolffd@0: 
wolffd@0: 
wolffd@0: 
wolffd@0: 
wolffd@0: 
wolffd@0: