networkx.algorithms.tree.decomposition.junction_tree¶
- junction_tree(G)[source]¶
Returns a junction tree of a given graph.
A junction tree (or clique tree) is constructed from a (un)directed graph G. The tree is constructed based on a moralized and triangulated version of G. The tree’s nodes consist of maximal cliques and sepsets of the revised graph. The sepset of two cliques is the intersection of the nodes of these cliques, e.g. the sepset of (A,B,C) and (A,C,E,F) is (A,C). These nodes are often called “variables” in this literature. The tree is bipartitie with each sepset connected to its two cliques.
Junction Trees are not unique as the order of clique consideration determines which sepsets are included.
The junction tree algorithm consists of five steps [1]:
Moralize the graph
Triangulate the graph
Find maximal cliques
Build the tree from cliques, connecting cliques with shared nodes, set edge-weight to number of shared variables
Find maximum spanning tree
- Parameters
- Gnetworkx.Graph
Directed or undirected graph.
- Returns
- junction_treenetworkx.Graph
The corresponding junction tree of
G
.
- Raises
- NetworkXNotImplemented
Raised if
G
is an instance ofMultiGraph
orMultiDiGraph
.
References
- 1
Junction tree algorithm: https://en.wikipedia.org/wiki/Junction_tree_algorithm
- 2
Finn V. Jensen and Frank Jensen. 1994. Optimal junction trees. In Proceedings of the Tenth international conference on Uncertainty in artificial intelligence (UAI’94). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 360–366.