get_triang_graph

Retrieve the triangulated graph from

Minimal and memory efficient implementation of the junction tree
algorithm using the Lauritzen-Spiegelhalter scheme;
S. L. Lauritzen and D. J. Spiegelhalter (1988)
<https://www.jstor.org/stable/2345762?seq=1>. The jti package is
part of the paper <doi:10.18637/jss.v111.i02>.

Mads Lindskou

Junction Tree Inference

get_triang_graph function

<dl><dt>x</dt>
<dd>A compiled object</dd></dl>

Arguments

Get triangulated graph — get_triang_graph

<dl>

<dt>x</dt>
<dd>A compiled object</dd>

</dl>

get_triang_graph: Get triangulated graph

Description

Usage

Value

Arguments