huge_network subset (N=30)¶
The first 30 nodes of data/huge_network.json in topological order. Taking a topological prefix preserves parent-child structure: every retained node's parents are also in the subset, so the result is a well-formed Bayesian network from the same topology family as the full 39-node fixture.
Bayesian network (DAG)¶
flowchart TB
node11["node11"]
node12["node12"]
node14["node14"]
node15["node15"]
node16["node16"]
node19["node19"]
node20["node20"]
node21["node21"]
node22["node22"]
node23["node23"]
node26["node26"]
node27["node27"]
node28["node28"]
node29["node29"]
node3["node3"]
node30["node30"]
node39["node39"]
node4["node4"]
node5["node5"]
node6["node6"]
node7["node7"]
node8["node8"]
node9["node9"]
node10["node10"]
node13["node13"]
node18["node18"]
node25["node25"]
node2["node2"]
node17["node17"]
node38["node38"]
node11 --> node10
node12 --> node10
node14 --> node13
node15 --> node13
node19 --> node18
node20 --> node18
node21 --> node18
node22 --> node18
node26 --> node25
node27 --> node25
node28 --> node25
node29 --> node25
node30 --> node25
node3 --> node2
node4 --> node2
node5 --> node2
node6 --> node2
node7 --> node2
node8 --> node2
node9 --> node2
node23 --> node17
node18 --> node17
node2 --> node38
node10 --> node38
Junction forest¶
The junction graph here is a forest of 6 disconnected components, not a single tree. Cliques are labelled with their variable sets; edges labelled with the separator (the intersection of the two cliques' domains). Cliques without an edge to anything are isolated components.
flowchart LR
C0["C0<br/>node2, node3, node4, node5, node6, node7, node8, node9"]
C1["C1<br/>node2, node10, node38"]
C2["C2<br/>node10, node11, node12"]
C3["C3<br/>node13, node14, node15"]
C4["C4<br/>node16"]
C5["C5<br/>node17, node18, node23"]
C6["C6<br/>node18, node19, node20, node21, node22"]
C7["C7<br/>node25, node26, node27, node28, node29, node30"]
C8["C8<br/>node39"]
C0 ---|"node2"| C1
C1 ---|"node10"| C2
C5 ---|"node18"| C6