Changes in version 0.5.1 (2026-03-26)                  

  - Fixed bugs in the fullFactorCriterion and extmID functions.

                 Changes in version 0.5.0 (2026-01-30)                  

  - Algorithms (mID and extmID) that efficiently check M-identifiability
    and extended M-identifiability in sparse factor analysis graphs.

                 Changes in version 0.4.2 (2025-10-21)                  

  - Updated functions to accommodate changes in igraph’s get_edge_ids()
    behavior.

                 Changes in version 0.4.1 (2023-07-19)                  

  - Fixed bug in the globalID function.
  - Correction of some errors in the documentation.

                 Changes in version 0.4.0 (2022-01-13)                  

  - 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().