idaFast() regression tests, using
round(*) == round(*), notably for ATLAS-using
Tiny bug fix for fci.
‘Proper’ registration of
.Call()ed C routines.
if(class(.) = "...")
Adapt to upcoming deprecation of C++
updated links, removed old vignette.
adapt to R-devel's new/changed warning of
summary() methods for
as(*, "amat") methods to get the adjacency matrix
of a model, including a
print() method for "amat"s.
?amatType documents the different kinds of adjacency matrices
New functions ......
LINGAM() in favor of new
allDags() in favor of
Bug fix in
Bug fix in
LINGAM(., verbose=FALSE) (the default, now tested).
plot(pc(..), zvalue.lwd=TRUE), and better document
that plot method.
|S| in 1:4 or so.
More test coverage, notably for
r.gauss.pardag() gets an optional argument
Adapt to API change in igraph package.
More test coverage and first speed tweaks.
gac for testing if a set of nodes satisfies
the Generalized Adjustment Criterion (GAC). GAC is a sufficient and
necessary criterion for estimating causal effects via covariate
adjustment in DAGs, CPDAGs, MAGs and PAGs.
randDAG for generating random directed acyclic
graphs (DAGs) with fixed expected number of neighbours. Several
different methods are provided, each intentionally biased towards
certain properties. The methods are based on the analogue functions
in the igraph package.
unifDAG.approx for uniform
sampling of a labelled directed acyclic graph (DAG) with combinatorial
LINGAM for estimating the structure of Linear
non-Gaussian Additive Models
fciPlus for a fast (but accurate) version of
fci (note that the already existing function
rfci is a
fast approximation of
ges for score based learning
backdoor for generalized backdoor criterion
Bugfix in function
wgtMatrix; this affects functions
rmvDAG; to reproduce old version, use option 'back.compatible =
have 'alpha' as third argument,
then 'labels, p' where 'p' is optional; namely, derived from 'labels'
when these are specified.
The default for extending the skeleton to a CPDAG is now
udag2pdagRelaxed, which is completely deterministic (was
before, which can use random orientations if sampling errors occur).