C_GtoI_G                This function returns the log of the G-Wishart
                        normalising constant I_G(beta, D) =
                        int_[S^p_++(G)] det(K)^beta * exp(-tr(KD)) dK
                        from the transformed version log(C_G(delta, D))
                        = int_[S^p_++(G)] det(K)^((delta-2)/2) *
                        exp(-tr(KD)/2) dK
Clique_complete         Clique-completion
I_G_BD                  This function is a wrapper for BDgraph to
                        compare and to avoid the NOTE in the package
                        checks since we only had BDgraph in the
                        examples
I_G_MC                  G Wishart normalising constant through MC
                        integration
I_G_chordal             G Wishart normalising constant for chordal
                        graphs
I_G_complete            G Wishart normalising constant for complete
                        graphs
I_G_ratio_approx        G Wishart normalising constant
I_G_ratio_approx_prime
                        This function returns the approximation of the
                        ratio of log transformed G-Wishart normalising
                        constants I_G(beta, D) / I_G(beta, I) for
                        connected prime graphs G.  If there is no
                        explicit formula, the approximation is used.
                        Note that this is the same as the ratio
                        C_G(delta, D) / C_G(delta, I) with delta =
                        2*beta + 2
I_G_special             G Wishart normalising constant for special
                        cases
I_Gnorm                 G Wishart normalising constant
I_GtoC_G                This function returns the log of the G-Wishart
                        normalising constant log(C_G(delta, D)) =
                        int_[S^p_++(G)] det(K)^((delta-2)/2) *
                        exp(-tr(KD)/2) dK from the transformed version
                        I_G(beta, D) = int_[S^p_++(G)] det(K)^beta *
                        exp(-tr(KD)) dK
Iss_cmat                Isserlis complement matrix
Iss_mat                 Isserlis matrix
PD_complete             PD-completion
annotate_cliques        this helper function adds information to
                        cliques related to the missing edges
check_prime_connected   This function just checks if a graph is
                        connected and prime
chordal_factor          Chordal Factor # do not export
clique_update_D         Newton-Raphson update for the clique-completion
form_triangle           Find triangle contains two missing edges # do
                        not export
is_6_cycle              Determine whether the graph is the cycle of
                        length 6 or its complement
is_k_partite            Determine whether the graph is complete k
                        partite
local_mean_grad         Compute means and gradients for the
                        Newton-Raphson update for the clique-completion
local_precision         Compute second moment of the log expansion of
                        the determinant (assuming the mean is 0 from
                        Clique_completion)
predict_row             Predict Row # do not export
prime_decomp            Prime Decomposition
