The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
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.4 |
Depends: | R (≥ 3.5.0) |
Imports: | Rcpp, igraph, sparta |
LinkingTo: | Rcpp, RcppArmadillo |
Suggests: | rmarkdown, knitr, tinytest, ess |
Published: | 2022-04-12 |
DOI: | 10.32614/CRAN.package.jti |
Author: | Mads Lindskou [aut, cre] |
Maintainer: | Mads Lindskou <madslindskou at gmail.com> |
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 |
Vignettes: |
using_jti |
Package source: | jti_0.8.4.tar.gz |
Windows binaries: | r-devel: jti_0.8.4.zip, r-release: jti_0.8.4.zip, r-oldrel: jti_0.8.4.zip |
macOS binaries: | r-release (arm64): jti_0.8.4.tgz, r-oldrel (arm64): jti_0.8.4.tgz, r-release (x86_64): jti_0.8.4.tgz, r-oldrel (x86_64): jti_0.8.4.tgz |
Old sources: | jti archive |
Please use the canonical form https://CRAN.R-project.org/package=jti to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.