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>.
| Version: | 0.8.3 |
| Depends: | R (≥ 3.5.0) |
| Imports: | Rcpp, igraph, sparta |
| LinkingTo: | Rcpp, RcppArmadillo |
| Suggests: | tinytest |
| Published: | 2022-02-07 |
| Author: | Mads Lindskou [aut, cre] |
| Maintainer: | Mads Lindskou <mads at math.aau.dk> |
| License: | GPL-3 |
| URL: | https://github.com/mlindsk/jti |
| NeedsCompilation: | yes |
| SystemRequirements: | C++11 |
| Materials: | README NEWS |
| CRAN checks: | jti results |
| Reference manual: | jti.pdf |
| Package source: | jti_0.8.3.tar.gz |
| Windows binaries: | r-devel: jti_0.8.3.zip, r-release: jti_0.8.3.zip, r-oldrel: jti_0.8.3.zip |
| macOS binaries: | r-release (arm64): jti_0.8.3.tgz, r-release (x86_64): jti_0.8.3.tgz, r-oldrel: jti_0.8.3.tgz |
| Old sources: | jti archive |
Please use the canonical form https://CRAN.R-project.org/package=jti to link to this page.