Version 0.4.0 on CRAN

• An algorithm (lfhtcID) that efficiently checks the latent-factor half-trek criterion to determine which edges in a latent digraph are generically identifiable.
• Two new methods for the LatentDigraph class: observedParents(), getMixedGraph().