alltopsorts_recursion

This function computes all topological orderings of a graph
using the recursive algorithm described in Knuth and Szwarcfiter (1974).

Implements the truncated harmonic mean estimator (THAMES)
of the reciprocal marginal likelihood for uni- and multivariate mixture
models using posterior samples and unnormalized log posterior values via
reciprocal importance sampling.
Metodiev, Irons, Perrot-Dockès, Latouche & Raftery (2025)
<doi:10.48550/arXiv.2504.21812>.

Martin Metodiev

thamesmix

Truncated Harmonic Mean Estimator of the Marginal Likelihood for
Mixtures

Nicholas J. Irons

Marie Perrot-Dockès

alltopsorts_recursion function

<dl><dt>n</dt>
<dd>number of nodes in the DAG</dd>
<dt>adj_list</dt>
<dd>edges given as an adjacency list</dd></dl>

Arguments

all topological orderings of a DAG — alltopsorts_recursion

<dl>

<dt>n</dt>
<dd>number of nodes in the DAG</dd>


<dt>adj_list</dt>
<dd>edges given as an adjacency list</dd>

</dl>

alltopsorts_recursion: all topological orderings of a DAG

Description

Usage

Value

Arguments

References

Examples