some graphs may have problem, I cannot put in my graph

[ekko2]

No description provided.

[vangj]

hi, i think i've troubleshooted this problem. on page 15 of the huang paper, he says to build the optimal join tree until n-1 (n = the number of cliques) separation sets (sepsets) are added. sometimes, as in your case, the same sepset is reused to connect multiple cliques. so, following his algorithm literally will fail. i've revised the algorithm to 1) get only sepsets that have an intersection and 2) add all nodes to the join tree for form a connected graph (if it's connected, though, not tested for a disconnected join tree yet). the new version released is 0.1.5. cheers.

[vangj]

take a look here, your graph is placed as a unit test (though without assertions).

https://github.com/vangj/py-bbn/blob/master/tests/graph/test_jointree.py#L98