public JunctionTree junctionTree(List<OpenBitSet> cliques, boolean init) {
        return junctionTree(null, null, null, cliques, init);
    }
@Test
    public void testJunctionTreeNoPruning() {
        Graph<BayesVariable> graph = new BayesNetwork();
        GraphNode x0 = addNode(graph);
        GraphNode x1 = addNode(graph);
        GraphNode x2 = addNode(graph);
        GraphNode x3 = addNode(graph);
        GraphNode x4 = addNode(graph);
        GraphNode x5 = addNode(graph);
        GraphNode x6 = addNode(graph);
        GraphNode x7 = addNode(graph);

        List<OpenBitSet> list = new ArrayList<OpenBitSet>();
        OpenBitSet OpenBitSet1 = bitSet("00001111");
        OpenBitSet OpenBitSet2 = bitSet("00111100");
        OpenBitSet OpenBitSet3 = bitSet("11100000"); // linear

        OpenBitSet intersect1And2 = OpenBitSet2.clone();
        intersect1And2.and(OpenBitSet1);

        OpenBitSet intersect2And3 = OpenBitSet2.clone();
        intersect2And3.and(OpenBitSet3);

        list.add(OpenBitSet1);
        list.add(OpenBitSet2);
        list.add(OpenBitSet3);

        JunctionTreeBuilder jtBuilder = new JunctionTreeBuilder( graph );
        JunctionTreeClique jtNode = jtBuilder.junctionTree(list, false).getRoot();


        assertThat(jtNode.getBitSet()).isEqualTo(OpenBitSet1);
        assertThat(jtNode.getChildren().size()).isEqualTo(1);
        JunctionTreeSeparator sep =  jtNode.getChildren().get(0);
        assertThat(sep.getParent().getBitSet()).isEqualTo(OpenBitSet1);
        assertThat(sep.getChild().getBitSet()).isEqualTo(OpenBitSet2);
        assertThat(sep.getBitSet()).isEqualTo(intersect1And2);

        jtNode = sep.getChild();
        assertThat(jtNode.getBitSet()).isEqualTo(OpenBitSet2);
        assertThat(jtNode.getChildren().size()).isEqualTo(1);
        sep =   jtNode.getChildren().get(0);
        assertThat(sep.getParent().getBitSet()).isEqualTo(OpenBitSet2);
        assertThat(sep.getChild().getBitSet()).isEqualTo(OpenBitSet3);
        assertThat(sep.getBitSet()).isEqualTo(intersect2And3);
    }