Uses of Interface
edu.cmu.tetrad.search.IGraphSearch

Packages that use IGraphSearch
Package
Description
This package contains classes for causal graph search algorithms.
 
 
This package contains classes for testing causal graph search algorithms.
This package contains utility classes for causal graph search algorithms.
A package for algorithms that are not ready for prime time.
 
  • Uses of IGraphSearch in edu.cmu.tetrad.search

    Modifier and Type
    Interface
    Description
    interface 
    The IFas interface represents a framework for performing fast adjacency search in graph structures.
    Classes in edu.cmu.tetrad.search that implement IGraphSearch
    Modifier and Type
    Class
    Description
    final class 
    Uses BOSS in the *-FCI algorithm.
    final class 
    FROZEN REFERENCE (2026-10-21): this formulation became the shipping StarFci/Bfci; the class is kept unchanged, off the interface, so that saved sessions that used "BFCI-Bryan" still load.
    final class 
    BFCI-Bryan-Score: BfciBryan with a SCORING STEP added to every gated move, following Bryan Andrews's pseudocode "BFCI-Bryan with scoring".
    final class 
    Uses BOSS in the sepset-projection *-FCI variant; see StarFciC.
    final class 
    Uses BOSS in the sepset-projection-with-R4-fallback *-FCI variant; see StarFciD.
    final class 
    EXPERIMENTAL: BFCI with a per-removal SCORE CHECK ("tests propose, scores dispose").
    final class 
    BOSS-CCD: Cyclic Causal Discovery (Richardson's CCD) with the adjacency phase delegated to BOSS.
    final class 
    Cyclic Causal Discovery (CCD) after Richardson.
    final class 
    Implements the CD-NOD (Causal Discovery from Non-stationary/heterogeneous Data) algorithm, which learns a causal graph from data in the presence of context variables that index changing causal mechanisms across data segments or environments.
    final class 
    Implements a variant of the CD-NOD (Causal Discovery from Non-stationary/ heterogeneous Data) algorithm that uses BOSS (Best Order Score Search) for the backbone rather than FAS.
    class 
    Implements the Fast Adjacency Search (FAS), which is the adjacency search of the PC algorithm (see).
    class 
    Adjusts FAS (see) for the deterministic case by refusing to removed edges based on conditional independence tests that are judged to be deterministic.
    final class 
    Deprecated.
    final class 
    The Fci class implements the Fast Causal Inference (FCI) algorithm for discovering causal structures from data.
    final class 
    The FCI Targeted Testing (FCIT) algorithm: learns a PAG from observational data with latent variables.
    final class 
    The FCI Targeted Testing (FCIT) algorithm: learns a PAG from observational data with latent variables.
    final class 
    The FCI Targeted Testing (FCIT) algorithm: learns a PAG from observational data with latent variables.
    final class 
    A Markov-preserving variant of FcitZm.
    final class 
    A Markov-preserving variant of Fcit.
    final class 
    FCIT-SL ("Step Lemma"): FCIT-ZM extended with a Step-Lemma-guided representative search.
    final class 
    FCIT-SL ("Step Lemma"): FCIT-ZM extended with a Step-Lemma-guided representative search.
    final class 
    KEEP-KNOWLEDGE VARIANT. This class is the knowledge-orientation-keeping variant of FcitSl, parallel to StarFciKeepKnowledgeOrientations and FcitKeepKnowledgeOrientations.
    final class 
    FCIT-SL-SCORE-CHECK: FcitSl with a MAG SCORE CHECK on every candidate the search adjudicates.
    final class 
    FCIT with a MAG-side legality gate.
    final class 
    FCIT with a MAG-side legality gate.
    final class 
    FCIT with a MAG-side legality gate.
    class 
    Implements the Fast Greedy Equivalence Search (FGES) algorithm.
    final class 
    Uses FGES for the initial step of *-FCI.
    class 
    Implements the GFCI (Greedy Fast Causal Inference) algorithm as described in:
    final class 
    GMAS: a latent-variable search that uses NO independence tests at all.
    final class 
    Uses GRaSP in the *-FCI algorithm.
    final class 
    Implements the Iterative Causal Discovery (ICD) algorithm for learning a Partial Ancestral Graph (PAG) from observational data.
    final class 
    LV-Heuristic is a class that implements the IGraphSearch interface.
    class 
    Implements the PC (Peter–Clark) causal discovery algorithm for learning a causal graph from conditional independence information.
    class 
    Implements the PC (Peter–Clark) causal discovery algorithm for learning a causal graph from conditional independence information.
    class 
    Modifies the PC algorithm to handle the deterministic case.
    final class 
    Searches for a CPDAG representing all the Markov blankets for a given target T consistent with the given independence information.
    final class 
    PCMCI (Runge et al.) — minimal, time-series implementation with lagged edges only (τ≥1).
    final class 
    Implements the Really Fast Causal Inference (RFCI) algorithm, which aims to do a correct inference of inferrable causal structure under the assumption that unmeasured common causes of variables in the data may exist.
    final class 
    Uses SP in place of FGES for the initial step in the *-FCI algorithm.
    class 
    *-FCI (StarFCI): the shipping latent-variable search of the StarFCI paper (Ramsey, Andrews, and Spirtes), in the sepset-map-as-state formulation due to Bryan Andrews.
    class 
    *-FCI (StarFCI): the GFCI-template latent-variable search of the StarFCI paper (Ramsey, Andrews, and Spirtes, "StarFCI: A GFCI-Template Latent-Variable Search that Returns a PAG by Construction"), with the Markov-CPDAG initializer abstracted (StarFciB.getMarkovCpdag(boolean)) and supplied by subclasses: Gfci (from FGES), Bfci (from BOSS), GraspFci (from GRaSP), SpFci (from SP).
    class 
    EXPERIMENTAL VARIANT (2026-10-19): StarFci with the PAG inference replaced by SEPSET PROJECTION.
    class 
    EXPERIMENTAL VARIANT (2026-10-19): StarFciC (sepset projection) PLUS the recursive-blocking R4 fallback.
    class 
    Deprecated.
    Legacy shell over StarFciOriginal; extend StarFci instead.
    class 
    Deprecated.
    The knowledge handling of this class has been consolidated into StarFci (formerly StarFciGuaranteePag); with empty knowledge the two already coincided.
    class 
    ORIGINAL *-FCI implementation (CPDAG-collider copy plus sepset stamps, frozen sepsets, saturating step, gated or ungated), preserved under this name on 2026-10-21 when StarFci was replaced by the sepset-projection / re-selection formulation (formerly BfciBryan).
    class 
    Deprecated.
    final class 
    Greedy local-search model-repair algorithm for causal graphs.
  • Uses of IGraphSearch in edu.cmu.tetrad.search.is

    Classes in edu.cmu.tetrad.search.is that implement IGraphSearch
    Modifier and Type
    Class
    Description
    class 
    Instance-Specific FGES: reuses the FGES search machinery but overrides the bump computations to use IsScore (instance-specific) rather than the pure population score.
    final class 
    Instance-specific FGES→FCI wrapper ("IS-GFCI").
  • Uses of IGraphSearch in edu.cmu.tetrad.search.mimic

    Classes in edu.cmu.tetrad.search.mimic that implement IGraphSearch
    Modifier and Type
    Class
    Description
    final class 
    Deprecated.
    class 
    Implements a Murray-Watters/Glymour style Detect-Mimic search ("DM").
    class 
    A hybrid detect-mimic heuristic.
    class 
    A more robust detect-mimic heuristic for MIMIC-like structures.
  • Uses of IGraphSearch in edu.cmu.tetrad.search.test

    Methods in edu.cmu.tetrad.search.test with parameters of type IGraphSearch
    Modifier and Type
    Method
    Description
    static Graph
    IndTestFdrWrapper.doFdrLoop(IGraphSearch search, boolean negativelyCorrelated, double alpha, double fdrQ, boolean verbose)
    Executes a loop for controlling the false discovery rate (FDR) as part of a graph search process.
  • Uses of IGraphSearch in edu.cmu.tetrad.search.utils

    Classes in edu.cmu.tetrad.search.utils that implement IGraphSearch
    Modifier and Type
    Class
    Description
    final class 
    This Orients a given undirected graph such that the edges in the graph are a superset of the edges in the oriented graph, using FGES method.
  • Uses of IGraphSearch in edu.cmu.tetrad.search.work_in_progress

    Modifier and Type
    Class
    Description
    class 
    Deprecated.
    class 
    Implements the MMHC algorithm.
    final class 
    Implements a conservative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.
    final class 
    Implements a conservative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.
    final class 
    Implements a convervative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.
    final class 
    Implements a convervative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.
    final class 
    Implements a convervative version of PC, in which the Markov condition is assumed but faithfulness is tested locally.
  • Uses of IGraphSearch in edu.pitt.dbmi.algo.bayesian.constraint.search

    Modifier and Type
    Class
    Description
    class 
    Jan 29, 2023 4:10:52 PM
    class 
    Implements the RFCI-BSC (Really Fast Causal Inference with Bayesian Scoring of Constraints) algorithm for learning PAGs (Partial Ancestral Graphs) from discrete data with probabilistic uncertainty quantification.