Uses of Interface
edu.cmu.tetrad.graph.Graph

Packages that use Graph

Package	Description
edu.cmu.tetrad.algcomparison.algorithm
edu.cmu.tetrad.algcomparison.algorithm.cluster
edu.cmu.tetrad.algcomparison.algorithm.continuous.dag
edu.cmu.tetrad.algcomparison.algorithm.external
edu.cmu.tetrad.algcomparison.algorithm.mixed
edu.cmu.tetrad.algcomparison.algorithm.multi
edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag
edu.cmu.tetrad.algcomparison.algorithm.oracle.pag
edu.cmu.tetrad.algcomparison.algorithm.oracle.pattern
edu.cmu.tetrad.algcomparison.algorithm.other
edu.cmu.tetrad.algcomparison.algorithm.pairwise
edu.cmu.tetrad.algcomparison.graph
edu.cmu.tetrad.algcomparison.independence
edu.cmu.tetrad.algcomparison.score
edu.cmu.tetrad.algcomparison.simulation
edu.cmu.tetrad.algcomparison.statistic
edu.cmu.tetrad.algcomparison.statistic.utils
edu.cmu.tetrad.bayes
edu.cmu.tetrad.calibration
edu.cmu.tetrad.data
edu.cmu.tetrad.data.simulation
edu.cmu.tetrad.graph
edu.cmu.tetrad.performance
edu.cmu.tetrad.regression
edu.cmu.tetrad.search
edu.cmu.tetrad.search.mb
edu.cmu.tetrad.sem
edu.cmu.tetrad.simulation
edu.cmu.tetrad.util
edu.pitt.csb.mgm
edu.pitt.csb.stability
edu.pitt.dbmi.algo.bayesian.constraint.search
edu.pitt.dbmi.algo.resampling
edu.pitt.dbmi.algo.resampling.task

Uses of Graph in edu.cmu.tetrad.algcomparison.algorithm

Methods in edu.cmu.tetrad.algcomparison.algorithm that return Graph

Modifier and Type	Method	Description
Graph	Algorithm.getComparisonGraph(Graph graph)	Returns that graph that the result should be compared to.
Graph	FirstInflection.getComparisonGraph(Graph graph)
Graph	StabilitySelection.getComparisonGraph(Graph graph)
Graph	StARS.getComparisonGraph(Graph graph)
Graph	Algorithm.search(DataModel dataSet, Parameters parameters)	Runs the search.
Graph	FirstInflection.search(DataModel dataSet, Parameters parameters)
Graph	MultiDataSetAlgorithm.search(List<DataModel> dataSets, Parameters parameters)	Runs the search.
Graph	StabilitySelection.search(DataModel dataSet, Parameters parameters)
Graph	StARS.search(DataModel dataSet, Parameters parameters)

Methods in edu.cmu.tetrad.algcomparison.algorithm that return types with arguments of type Graph

Modifier and Type	Method	Description
List<Graph>	ReturnsBootstrapGraphs.getBootstrapGraphs()

Methods in edu.cmu.tetrad.algcomparison.algorithm with parameters of type Graph

Modifier and Type	Method	Description
static Algorithm	AlgorithmFactory.create(Class<? extends Algorithm> algoClass, IndependenceWrapper test, ScoreWrapper score, Graph externalGraph)
static Algorithm	AlgorithmFactory.create(Class<? extends Algorithm> algoClass, Class<? extends IndependenceWrapper> indTestClass, Class<? extends ScoreWrapper> scoreClass, Graph externalGraph)
Graph	Algorithm.getComparisonGraph(Graph graph)	Returns that graph that the result should be compared to.
Graph	FirstInflection.getComparisonGraph(Graph graph)
Graph	StabilitySelection.getComparisonGraph(Graph graph)
Graph	StARS.getComparisonGraph(Graph graph)

Uses of Graph in edu.cmu.tetrad.algcomparison.algorithm.cluster

Methods in edu.cmu.tetrad.algcomparison.algorithm.cluster that return Graph

Modifier and Type	Method	Description
Graph	Bpc.getComparisonGraph(Graph graph)
Graph	Fofc.getComparisonGraph(Graph graph)
Graph	Ftfc.getComparisonGraph(Graph graph)
Graph	Bpc.search(DataModel dataSet, Parameters parameters)
Graph	Fofc.search(DataModel dataSet, Parameters parameters)
Graph	Ftfc.search(DataModel dataSet, Parameters parameters)

Methods in edu.cmu.tetrad.algcomparison.algorithm.cluster with parameters of type Graph

Modifier and Type	Method	Description
Graph	Bpc.getComparisonGraph(Graph graph)
Graph	Fofc.getComparisonGraph(Graph graph)
Graph	Ftfc.getComparisonGraph(Graph graph)

Uses of Graph in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag

Methods in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag that return Graph

Modifier and Type	Method	Description
Graph	Ling.getComparisonGraph(Graph graph)
Graph	Lingam.getComparisonGraph(Graph graph)
Graph	Ling.search(DataModel dataSet, Parameters parameters)
Graph	Lingam.search(DataModel dataSet, Parameters parameters)

Methods in edu.cmu.tetrad.algcomparison.algorithm.continuous.dag with parameters of type Graph

Modifier and Type	Method	Description
Graph	Ling.getComparisonGraph(Graph graph)
Graph	Lingam.getComparisonGraph(Graph graph)

Uses of Graph in edu.cmu.tetrad.algcomparison.algorithm.external

Methods in edu.cmu.tetrad.algcomparison.algorithm.external that return Graph

Modifier and Type	Method	Description
Graph	ExternalAlgorithmBnlearnMmhc.getComparisonGraph(Graph graph)	Returns the CPDAG of the supplied DAG.
Graph	ExternalAlgorithmBNTPc.getComparisonGraph(Graph graph)	Returns the CPDAG of the supplied DAG.
Graph	ExternalAlgorithmIntersection.getComparisonGraph(Graph graph)	Returns the CPDAG of the supplied DAG.
Graph	ExternalAlgorithmPcalgGes.getComparisonGraph(Graph graph)	Returns the CPDAG of the supplied DAG.
Graph	ExternalAlgorithmPcalgPc.getComparisonGraph(Graph graph)	Returns the CPDAG of the supplied DAG.
Graph	ExternalAlgorithmTetrad.getComparisonGraph(Graph graph)	Returns the CPDAG of the supplied DAG.
static Graph	ExternalAlgorithmPcalgPc.loadGraphPcAlgMatrix(DataSet dataSet)
Graph	ExternalAlgorithmBnlearnMmhc.search(DataModel dataSet, Parameters parameters)	Reads in the relevant graph from the file (see above) and returns it.
Graph	ExternalAlgorithmBNTPc.search(DataModel dataSet, Parameters parameters)	Reads in the relevant graph from the file (see above) and returns it.
Graph	ExternalAlgorithmIntersection.search(DataModel dataSet, Parameters parameters)	Reads in the relevant graph from the file (see above) and returns it.
Graph	ExternalAlgorithmPcalgGes.search(DataModel dataSet, Parameters parameters)	Reads in the relevant graph from the file (see above) and returns it.
Graph	ExternalAlgorithmPcalgPc.search(DataModel dataSet, Parameters parameters)	Reads in the relevant graph from the file (see above) and returns it.
Graph	ExternalAlgorithmTetrad.search(DataModel dataSet, Parameters parameters)	Reads in the relevant graph from the file and returns it.

Methods in edu.cmu.tetrad.algcomparison.algorithm.external with parameters of type Graph

Modifier and Type	Method	Description
Graph	ExternalAlgorithmBnlearnMmhc.getComparisonGraph(Graph graph)	Returns the CPDAG of the supplied DAG.
Graph	ExternalAlgorithmBNTPc.getComparisonGraph(Graph graph)	Returns the CPDAG of the supplied DAG.
Graph	ExternalAlgorithmIntersection.getComparisonGraph(Graph graph)	Returns the CPDAG of the supplied DAG.
Graph	ExternalAlgorithmPcalgGes.getComparisonGraph(Graph graph)	Returns the CPDAG of the supplied DAG.
Graph	ExternalAlgorithmPcalgPc.getComparisonGraph(Graph graph)	Returns the CPDAG of the supplied DAG.
Graph	ExternalAlgorithmTetrad.getComparisonGraph(Graph graph)	Returns the CPDAG of the supplied DAG.

Uses of Graph in edu.cmu.tetrad.algcomparison.algorithm.mixed

Methods in edu.cmu.tetrad.algcomparison.algorithm.mixed that return Graph

Modifier and Type	Method	Description
Graph	Mgm.getComparisonGraph(Graph graph)
Graph	Mgm.search(DataModel ds, Parameters parameters)

Methods in edu.cmu.tetrad.algcomparison.algorithm.mixed with parameters of type Graph

Modifier and Type	Method	Description
Graph	Mgm.getComparisonGraph(Graph graph)

Uses of Graph in edu.cmu.tetrad.algcomparison.algorithm.multi

Methods in edu.cmu.tetrad.algcomparison.algorithm.multi that return Graph

Modifier and Type	Method	Description
Graph	CcdMaxConcatenated.getComparisonGraph(Graph graph)
Graph	Fask.getComparisonGraph(Graph graph)
Graph	FaskConcatenated.getComparisonGraph(Graph graph)
Graph	FaskLofsConcatenated.getComparisonGraph(Graph graph)
Graph	FaskVote.getComparisonGraph(Graph graph)
Graph	FasLofs.getComparisonGraph(Graph graph)
Graph	FgesConcatenated.getComparisonGraph(Graph graph)
Graph	Images.getComparisonGraph(Graph graph)
Graph	CcdMaxConcatenated.search(DataModel dataSet, Parameters parameters)
Graph	CcdMaxConcatenated.search(List<DataModel> dataModels, Parameters parameters)
Graph	Fask.search(DataModel dataSet, Parameters parameters)
Graph	FaskConcatenated.search(DataModel dataSet, Parameters parameters)
Graph	FaskConcatenated.search(List<DataModel> dataSets, Parameters parameters)
Graph	FaskLofsConcatenated.search(DataModel dataSet, Parameters parameters)
Graph	FaskLofsConcatenated.search(List<DataModel> dataModels, Parameters parameters)
Graph	FaskVote.search(DataModel dataSet, Parameters parameters)
Graph	FaskVote.search(List<DataModel> dataSets, Parameters parameters)
Graph	FasLofs.search(DataModel dataSet, Parameters parameters)
Graph	FgesConcatenated.search(DataModel dataSet, Parameters parameters)
Graph	FgesConcatenated.search(List<DataModel> dataModels, Parameters parameters)
Graph	Images.search(DataModel dataSet, Parameters parameters)
Graph	Images.search(List<DataModel> dataSets, Parameters parameters)

Methods in edu.cmu.tetrad.algcomparison.algorithm.multi with parameters of type Graph

Modifier and Type	Method	Description
Graph	CcdMaxConcatenated.getComparisonGraph(Graph graph)
Graph	Fask.getComparisonGraph(Graph graph)
Graph	FaskConcatenated.getComparisonGraph(Graph graph)
Graph	FaskLofsConcatenated.getComparisonGraph(Graph graph)
Graph	FaskVote.getComparisonGraph(Graph graph)
Graph	FasLofs.getComparisonGraph(Graph graph)
Graph	FgesConcatenated.getComparisonGraph(Graph graph)
Graph	Images.getComparisonGraph(Graph graph)

Uses of Graph in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag

Methods in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag that return Graph

Modifier and Type	Method	Description
Graph	Bdce.getComparisonGraph(Graph graph)
Graph	Boss.getComparisonGraph(Graph graph)
Graph	BossMb.getComparisonGraph(Graph graph)
Graph	BossMb2.getComparisonGraph(Graph graph)
Graph	Bridges.getComparisonGraph(Graph graph)
Graph	Bridges2.getComparisonGraph(Graph graph)
Graph	Cpc.getComparisonGraph(Graph graph)
Graph	CpcStable.getComparisonGraph(Graph graph)
Graph	Fas.getComparisonGraph(Graph graph)
Graph	Fges.getComparisonGraph(Graph graph)
Graph	FgesMb.getComparisonGraph(Graph graph)
Graph	FgesMeasurement.getComparisonGraph(Graph graph)
Graph	GesMe.getComparisonGraph(Graph graph)
Graph	Grasp.getComparisonGraph(Graph graph)
Graph	GraspTol.getComparisonGraph(Graph graph)
Graph	Pc.getComparisonGraph(Graph graph)
Graph	Pcd.getComparisonGraph(Graph graph)
Graph	PcMax.getComparisonGraph(Graph graph)
Graph	PcMb.getComparisonGraph(Graph graph)
Graph	PcStable.getComparisonGraph(Graph graph)
Graph	SingleGraphAlg.getComparisonGraph(Graph graph)
Graph	Sp.getComparisonGraph(Graph graph)
Graph	Bdce.search(DataModel dataModel, Parameters parameters)
Graph	Boss.search(DataModel dataModel, Parameters parameters)
Graph	BossMb.search(DataModel dataSet, Parameters parameters)
Graph	BossMb2.search(DataModel dataSet, Parameters parameters)
Graph	Bridges.search(DataModel dataModel, Parameters parameters)
Graph	Bridges2.search(DataModel dataModel, Parameters parameters)
Graph	Cpc.search(DataModel dataModel, Parameters parameters)
Graph	CpcStable.search(DataModel dataSet, Parameters parameters)
Graph	Fas.search(DataModel dataSet, Parameters parameters)
Graph	Fges.search(DataModel dataModel, Parameters parameters)
Graph	FgesMb.search(DataModel dataSet, Parameters parameters)
Graph	FgesMeasurement.search(DataModel dataModel, Parameters parameters)
Graph	GesMe.search(DataModel dataSet, Parameters parameters)
Graph	Grasp.search(DataModel dataModel, Parameters parameters)
Graph	GraspTol.search(DataModel dataModel, Parameters parameters)
Graph	Pc.search(DataModel dataModel, Parameters parameters)
Graph	Pcd.search(DataModel dataSet, Parameters parameters)
Graph	PcMax.search(DataModel dataModel, Parameters parameters)
Graph	PcMb.search(DataModel dataSet, Parameters parameters)
Graph	PcStable.search(DataModel dataSet, Parameters parameters)
Graph	SingleGraphAlg.search(DataModel dataSet, Parameters parameters)
Graph	Sp.search(DataModel dataModel, Parameters parameters)

Methods in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag that return types with arguments of type Graph

Modifier and Type	Method	Description
List<Graph>	Boss.getBootstrapGraphs()
List<Graph>	BossMb.getBootstrapGraphs()
List<Graph>	BossMb2.getBootstrapGraphs()
List<Graph>	Bridges.getBootstrapGraphs()
List<Graph>	Bridges2.getBootstrapGraphs()
List<Graph>	Cpc.getBootstrapGraphs()
List<Graph>	CpcStable.getBootstrapGraphs()
List<Graph>	Fas.getBootstrapGraphs()
List<Graph>	Fges.getBootstrapGraphs()
List<Graph>	FgesMb.getBootstrapGraphs()
List<Graph>	FgesMeasurement.getBootstrapGraphs()
List<Graph>	GesMe.getBootstrapGraphs()
List<Graph>	Grasp.getBootstrapGraphs()
List<Graph>	GraspTol.getBootstrapGraphs()
List<Graph>	Pc.getBootstrapGraphs()
List<Graph>	Pcd.getBootstrapGraphs()
List<Graph>	PcMax.getBootstrapGraphs()
List<Graph>	PcMb.getBootstrapGraphs()
List<Graph>	PcStable.getBootstrapGraphs()
List<Graph>	Sp.getBootstrapGraphs()

Methods in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag with parameters of type Graph

Modifier and Type	Method	Description
Graph	Bdce.getComparisonGraph(Graph graph)
Graph	Boss.getComparisonGraph(Graph graph)
Graph	BossMb.getComparisonGraph(Graph graph)
Graph	BossMb2.getComparisonGraph(Graph graph)
Graph	Bridges.getComparisonGraph(Graph graph)
Graph	Bridges2.getComparisonGraph(Graph graph)
Graph	Cpc.getComparisonGraph(Graph graph)
Graph	CpcStable.getComparisonGraph(Graph graph)
Graph	Fas.getComparisonGraph(Graph graph)
Graph	Fges.getComparisonGraph(Graph graph)
Graph	FgesMb.getComparisonGraph(Graph graph)
Graph	FgesMeasurement.getComparisonGraph(Graph graph)
Graph	GesMe.getComparisonGraph(Graph graph)
Graph	Grasp.getComparisonGraph(Graph graph)
Graph	GraspTol.getComparisonGraph(Graph graph)
Graph	Pc.getComparisonGraph(Graph graph)
Graph	Pcd.getComparisonGraph(Graph graph)
Graph	PcMax.getComparisonGraph(Graph graph)
Graph	PcMb.getComparisonGraph(Graph graph)
Graph	PcStable.getComparisonGraph(Graph graph)
Graph	SingleGraphAlg.getComparisonGraph(Graph graph)
Graph	Sp.getComparisonGraph(Graph graph)
void	Pc.setExternalGraph(Graph externalGraph)
void	PcMax.setExternalGraph(Graph externalGraph)

Constructors in edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag with parameters of type Graph

Modifier	Constructor	Description
	SingleGraphAlg(Graph graph)

Uses of Graph in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag

Methods in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag that return Graph

Modifier and Type	Method	Description
Graph	Bfci.getComparisonGraph(Graph graph)
Graph	BfciTr.getComparisonGraph(Graph graph)
Graph	Ccd.getComparisonGraph(Graph graph)
Graph	CcdMax.getComparisonGraph(Graph graph)
Graph	Cfci.getComparisonGraph(Graph graph)
Graph	Fci.getComparisonGraph(Graph graph)
Graph	FciMax.getComparisonGraph(Graph graph)
Graph	Gfci.getComparisonGraph(Graph graph)
Graph	GraspFci.getComparisonGraph(Graph graph)
Graph	PagSampleRfci.getComparisonGraph(Graph graph)
Graph	Rfci.getComparisonGraph(Graph graph)
Graph	RfciBsc.getComparisonGraph(Graph graph)
Graph	SpFci.getComparisonGraph(Graph graph)
Graph	SvarFci.getComparisonGraph(Graph graph)
Graph	SvarGfci.getComparisonGraph(Graph graph)
Graph	Bfci.search(DataModel dataModel, Parameters parameters)
Graph	BfciTr.search(DataModel dataModel, Parameters parameters)
Graph	Ccd.search(DataModel dataSet, Parameters parameters)
Graph	CcdMax.search(DataModel dataSet, Parameters parameters)
Graph	Cfci.search(DataModel dataSet, Parameters parameters)
Graph	Fci.search(DataModel dataModel, Parameters parameters)
Graph	FciMax.search(DataModel dataModel, Parameters parameters)
Graph	Gfci.search(DataModel dataModel, Parameters parameters)
Graph	GraspFci.search(DataModel dataModel, Parameters parameters)
Graph	PagSampleRfci.search(DataModel dataSet, Parameters parameters)
Graph	Rfci.search(DataModel dataModel, Parameters parameters)
Graph	RfciBsc.search(DataModel dataSet, Parameters parameters)
Graph	SpFci.search(DataModel dataModel, Parameters parameters)
Graph	SvarFci.search(DataModel dataModel, Parameters parameters)
Graph	SvarGfci.search(DataModel dataModel, Parameters parameters)

Methods in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag that return types with arguments of type Graph

Modifier and Type	Method	Description
List<Graph>	Bfci.getBootstrapGraphs()
List<Graph>	BfciTr.getBootstrapGraphs()
List<Graph>	Ccd.getBootstrapGraphs()
List<Graph>	CcdMax.getBootstrapGraphs()
List<Graph>	Cfci.getBootstrapGraphs()
List<Graph>	Fci.getBootstrapGraphs()
List<Graph>	FciMax.getBootstrapGraphs()
List<Graph>	Gfci.getBootstrapGraphs()
List<Graph>	GraspFci.getBootstrapGraphs()
List<Graph>	Rfci.getBootstrapGraphs()
List<Graph>	SpFci.getBootstrapGraphs()
List<Graph>	SvarFci.getBootstrapGraphs()
List<Graph>	SvarGfci.getBootstrapGraphs()

Methods in edu.cmu.tetrad.algcomparison.algorithm.oracle.pag with parameters of type Graph

Modifier and Type	Method	Description
Graph	Bfci.getComparisonGraph(Graph graph)
Graph	BfciTr.getComparisonGraph(Graph graph)
Graph	Ccd.getComparisonGraph(Graph graph)
Graph	CcdMax.getComparisonGraph(Graph graph)
Graph	Cfci.getComparisonGraph(Graph graph)
Graph	Fci.getComparisonGraph(Graph graph)
Graph	FciMax.getComparisonGraph(Graph graph)
Graph	Gfci.getComparisonGraph(Graph graph)
Graph	GraspFci.getComparisonGraph(Graph graph)
Graph	PagSampleRfci.getComparisonGraph(Graph graph)
Graph	Rfci.getComparisonGraph(Graph graph)
Graph	RfciBsc.getComparisonGraph(Graph graph)
Graph	SpFci.getComparisonGraph(Graph graph)
Graph	SvarFci.getComparisonGraph(Graph graph)
Graph	SvarGfci.getComparisonGraph(Graph graph)

Uses of Graph in edu.cmu.tetrad.algcomparison.algorithm.oracle.pattern

Methods in edu.cmu.tetrad.algcomparison.algorithm.oracle.pattern that return Graph

Modifier and Type	Method	Description
Graph	Cstar.getComparisonGraph(Graph graph)
Graph	Cstar.search(DataModel dataSet, Parameters parameters)

Methods in edu.cmu.tetrad.algcomparison.algorithm.oracle.pattern with parameters of type Graph

Modifier and Type	Method	Description
Graph	Cstar.getComparisonGraph(Graph graph)

Uses of Graph in edu.cmu.tetrad.algcomparison.algorithm.other

Methods in edu.cmu.tetrad.algcomparison.algorithm.other that return Graph

Modifier and Type	Method	Description
Graph	FactorAnalysis.getComparisonGraph(Graph graph)
Graph	Glasso.getComparisonGraph(Graph graph)
Graph	FactorAnalysis.search(DataModel ds, Parameters parameters)
Graph	Glasso.search(DataModel ds, Parameters parameters)

Methods in edu.cmu.tetrad.algcomparison.algorithm.other with parameters of type Graph

Modifier and Type	Method	Description
Graph	FactorAnalysis.getComparisonGraph(Graph graph)
Graph	Glasso.getComparisonGraph(Graph graph)

Uses of Graph in edu.cmu.tetrad.algcomparison.algorithm.pairwise

Methods in edu.cmu.tetrad.algcomparison.algorithm.pairwise that return Graph

Modifier and Type	Method	Description
Graph	Eb.getComparisonGraph(Graph graph)
Graph	FaskPw.getComparisonGraph(Graph graph)
Graph	R1.getComparisonGraph(Graph graph)
Graph	R2.getComparisonGraph(Graph graph)
Graph	R3.getComparisonGraph(Graph graph)
Graph	Rskew.getComparisonGraph(Graph graph)
Graph	RskewE.getComparisonGraph(Graph graph)
Graph	Skew.getComparisonGraph(Graph graph)
Graph	SkewE.getComparisonGraph(Graph graph)
Graph	Tanh.getComparisonGraph(Graph graph)
Graph	Eb.search(DataModel dataSet, Parameters parameters)
Graph	FaskPw.search(DataModel dataModel, Parameters parameters)
Graph	R1.search(DataModel dataSet, Parameters parameters)
Graph	R2.search(DataModel dataSet, Parameters parameters)
Graph	R3.search(DataModel dataSet, Parameters parameters)
Graph	Rskew.search(DataModel dataSet, Parameters parameters)
Graph	RskewE.search(DataModel dataSet, Parameters parameters)
Graph	Skew.search(DataModel dataSet, Parameters parameters)
Graph	SkewE.search(DataModel dataSet, Parameters parameters)
Graph	Tanh.search(DataModel dataSet, Parameters parameters)

Methods in edu.cmu.tetrad.algcomparison.algorithm.pairwise with parameters of type Graph

Modifier and Type	Method	Description
Graph	Eb.getComparisonGraph(Graph graph)
Graph	FaskPw.getComparisonGraph(Graph graph)
Graph	R1.getComparisonGraph(Graph graph)
Graph	R2.getComparisonGraph(Graph graph)
Graph	R3.getComparisonGraph(Graph graph)
Graph	Rskew.getComparisonGraph(Graph graph)
Graph	RskewE.getComparisonGraph(Graph graph)
Graph	Skew.getComparisonGraph(Graph graph)
Graph	SkewE.getComparisonGraph(Graph graph)
Graph	Tanh.getComparisonGraph(Graph graph)

Uses of Graph in edu.cmu.tetrad.algcomparison.graph

Methods in edu.cmu.tetrad.algcomparison.graph that return Graph

Modifier and Type	Method	Description
Graph	Cyclic.createGraph(Parameters parameters)
Graph	ErdosRenyi.createGraph(Parameters parameters)
Graph	RandomForward.createGraph(Parameters parameters)
Graph	RandomGraph.createGraph(Parameters parameters)
Graph	RandomSingleFactorMim.createGraph(Parameters parameters)
Graph	RandomTwoFactorMim.createGraph(Parameters parameters)
Graph	ScaleFree.createGraph(Parameters parameters)
Graph	SingleGraph.createGraph(Parameters parameters)

Constructors in edu.cmu.tetrad.algcomparison.graph with parameters of type Graph

Modifier	Constructor	Description
	SingleGraph(Graph graph)

Uses of Graph in edu.cmu.tetrad.algcomparison.independence

Methods in edu.cmu.tetrad.algcomparison.independence with parameters of type Graph

Modifier and Type	Method	Description
void	DSeparationTest.setGraph(Graph graph)
void	TakesGraph.setGraph(Graph graph)

Constructors in edu.cmu.tetrad.algcomparison.independence with parameters of type Graph

Modifier	Constructor	Description
	DSeparationTest(Graph graph)

Uses of Graph in edu.cmu.tetrad.algcomparison.score

Methods in edu.cmu.tetrad.algcomparison.score with parameters of type Graph

Modifier and Type	Method	Description
void	DSeparationScore.setGraph(Graph graph)

Constructors in edu.cmu.tetrad.algcomparison.score with parameters of type Graph

Modifier	Constructor	Description
	DSeparationScore(Graph graph)

Uses of Graph in edu.cmu.tetrad.algcomparison.simulation

Methods in edu.cmu.tetrad.algcomparison.simulation that return Graph

Modifier and Type	Method	Description
Graph	BayesNetSimulation.getTrueGraph(int index)
Graph	BooleanGlassSimulation.getTrueGraph(int index)
Graph	ConditionalGaussianSimulation.getTrueGraph(int index)
Graph	GeneralSemSimulation.getTrueGraph(int index)
Graph	GeneralSemSimulationSpecial1.getTrueGraph(int index)
Graph	LeeHastieSimulation.getTrueGraph(int index)
Graph	LinearFisherModel.getTrueGraph(int index)
Graph	LinearSineSimulation.getTrueGraph(int index)
Graph	SemSimulation.getTrueGraph(int index)
Graph	SemThenDiscretize.getTrueGraph(int index)
Graph	Simulation.getTrueGraph(int index)
Graph	StandardizedSemSimulation.getTrueGraph(int index)
Graph	TimeSeriesSemSimulation.getTrueGraph(int index)

Uses of Graph in edu.cmu.tetrad.algcomparison.statistic

Methods in edu.cmu.tetrad.algcomparison.statistic with parameters of type Graph

Modifier and Type	Method	Description
static boolean	CommonAncestorTruePositiveBidirected.existsCommonAncestor(Graph trueGraph, Edge edge)
static boolean	NumCommonMeasuredAncestorBidirected.existsCommonAncestor(Graph trueGraph, Edge edge)
boolean	NumDirectedEdgeNoMeasureAncestors.existsDirectedPathFromTo(Graph graph, Node node1, Node node2)
static boolean	LatentCommonAncestorTruePositiveBidirected.existsLatentCommonAncestor(Graph trueGraph, Edge edge)
double	AdjacencyFn.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	AdjacencyFp.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	AdjacencyFpr.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	AdjacencyPrecision.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	AdjacencyRecall.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	AdjacencyTn.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	AdjacencyTp.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	AdjacencyTpr.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	AncestorF1.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	AncestorPrecision.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	AncestorRecall.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	AncestralPrecision.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	AncestralRecall.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	ArrowheadFn.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	ArrowheadFp.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	ArrowheadFpr.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	ArrowheadPrecision.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	ArrowheadPrecisionCommonEdges.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	ArrowheadRecall.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	ArrowheadRecallCommonEdges.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	ArrowheadTn.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	ArrowheadTp.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	AverageDegreeEst.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	AverageDegreeTrue.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	BicDiff.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	BicDiffPerRecord.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	BicEst.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	BicTrue.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	BidirectedEst.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	BidirectedFP.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	BidirectedLatentPrecision.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	BidirectedPrecision.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	BidirectedRecall.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	BidirectedTP.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	BidirectedTrue.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	CommonAncestorFalseNegativeBidirected.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	CommonAncestorFalsePositiveBidirected.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	CommonAncestorTruePositiveBidirected.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	CommonMeasuredAncestorRecallBidirected.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	CorrectSkeleton.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	DefiniteDirectedPathPrecision.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	DefiniteDirectedPathRecall.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	DensityEst.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	DensityTrue.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	ElapsedCpuTime.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	F1Adj.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	F1All.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	F1Arrow.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	FalseNegativesAdjacencies.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	FalsePositiveAdjacencies.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	GraphExactlyRight.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	LatentCommonAncestorFalseNegativeBidirected.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	LatentCommonAncestorFalsePositiveBidirected.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	LatentCommonAncestorRecallBidirected.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	LatentCommonAncestorTruePositiveBidirected.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	LegalPag.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	MathewsCorrAdj.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	MathewsCorrArrow.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	MaximalityCondition.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NoAlmostCyclicPathsCondition.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NoAlmostCyclicPathsInMagCondition.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NoCyclicPathsCondition.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NoCyclicPathsInMagCondition.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NodesInCyclesPrecision.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NodesInCyclesRecall.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NonancestorPrecision.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NonancestorRecall.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NoSemidirectedF1.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NoSemidirectedPrecision.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NoSemidirectedRecall.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumAmbiguousTriples.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumberOfEdgesEst.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumberOfEdgesTrue.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumBidirectedBothNonancestorAncestor.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumBidirectedEdgesEst.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumBidirectedEdgesTrue.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumColoredDD.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumColoredNL.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumColoredPD.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumColoredPL.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumCommonMeasuredAncestorBidirected.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumCompatibleDefiniteDirectedEdgeAncestors.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumCompatibleDirectedEdgeConfounded.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumCompatibleDirectedEdgeNonAncestors.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumCompatibleEdges.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumCompatiblePossiblyDirectedEdgeAncestors.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumCompatiblePossiblyDirectedEdgeNonAncestors.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumCompatibleVisibleAncestors.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumCompatibleVisibleNonancestors.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumCorrectDDAncestors.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumCorrectPDAncestors.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumCorrectVisibleAncestors.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumDefinitelyDirected.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumDefinitelyNotDirectedPaths.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumDirectedEdgeAncestors.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumDirectedEdgeBnaMeasuredCounfounded.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumDirectedEdgeNoMeasureAncestors.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumDirectedEdgeNotAncNotRev.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumDirectedEdgeReversed.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumDirectedEdges.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumDirectedEdgeVisible.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumDirectedPathsEst.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumDirectedPathsTrue.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumDirectedShouldBePartiallyDirected.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumIncorrectDDAncestors.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumIncorrectPDAncestors.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumIncorrectVisibleAncestors.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumLatentCommonAncestorBidirected.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumNondirectedEdges.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumPartiallyOrientedEdges.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumPossiblyDirected.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumUndirectedEdges.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	NumVisibleEst.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	PagAdjacencyPrecision.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	PagAdjacencyRecall.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	ParameterColumn.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	PercentAmbiguous.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	PercentBidirectedEdges.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	ProportionSemidirectedPathsNotReversedEst.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	ProportionSemidirectedPathsNotReversedTrue.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	SemidirectedPathF1.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	SemidirectedPrecision.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	SemidirectedRecall.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	Shd.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	Statistic.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)	Returns the value of this statistic, given the true graph and the estimated graph.
double	TailPrecision.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TailRecall.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TrueDagFalseNegativesArrows.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TrueDagFalseNegativesTails.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TrueDagFalsePositiveArrow.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TrueDagFalsePositiveTails.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TrueDagPrecisionArrow.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TrueDagPrecisionTails.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TrueDagRecallArrows.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TrueDagRecallTails.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TrueDagTruePositiveArrow.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TrueDagTruePositiveDirectedPathNonancestor.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TrueDagTruePositiveTails.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TwoCycleFalseNegative.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TwoCycleFalsePositive.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TwoCyclePrecision.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TwoCycleRecall.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)
double	TwoCycleTruePositive.getValue(Graph trueGraph, Graph estGraph, DataModel dataModel)

Uses of Graph in edu.cmu.tetrad.algcomparison.statistic.utils

Constructors in edu.cmu.tetrad.algcomparison.statistic.utils with parameters of type Graph

Modifier	Constructor	Description
	AdjacencyConfusion(Graph truth, Graph est)
	ArrowConfusion(Graph truth, Graph est)
	ArrowConfusion(Graph truth, Graph est, boolean truthAdj)
	BidirectedConfusion(Graph truth, Graph est)
	TailConfusion(Graph truth, Graph est)

Uses of Graph in edu.cmu.tetrad.bayes

Methods in edu.cmu.tetrad.bayes that return Graph

Modifier and Type	Method	Description
Graph	BayesIm.getDag()
Graph	BayesPm.getDag()
Graph	DirichletBayesIm.getDag()
Graph	MlBayesIm.getDag()
Graph	MlBayesImObs.getDag()
Graph	UpdatedBayesIm.getDag()
Graph	ApproximateUpdater.getManipulatedGraph()
Graph	CptInvariantUpdater.getManipulatedGraph()
Graph	Identifiability.getManipulatedGraph()
Graph	JunctionTreeUpdater.getManipulatedGraph()
Graph	ManipulatingBayesUpdater.getManipulatedGraph()
Graph	RowSummingExactUpdater.getManipulatedGraph()
static Graph	GraphTools.moralize(Graph graph)	Create a moral graph.

Methods in edu.cmu.tetrad.bayes that return types with arguments of type Graph

Modifier and Type	Method	Description
static List<Graph>	ModelGenerator.generate(Graph graph)	This method takes an acyclic graph as input and returns a list of graphs each of which is a modification of the original graph with either an edge deleted, added or reversed.

Methods in edu.cmu.tetrad.bayes with parameters of type Graph

Modifier and Type	Method	Description
static void	GraphTools.fillIn(Graph graph, Node[] ordering)	Apply Tarjan and Yannakakis (1984) fill in algorithm for graph triangulation.
static List<Graph>	ModelGenerator.generate(Graph graph)	This method takes an acyclic graph as input and returns a list of graphs each of which is a modification of the original graph with either an edge deleted, added or reversed.
static Map<Node,Set<Node>>	GraphTools.getCliques(Node[] ordering, Graph graph)	Get cliques in a decomposable graph.
BayesProperties.LikelihoodRet	BayesProperties.getLikelihoodRatioP(Graph graph)	Calculates the p-value of the graph with respect to the given data.
static Node[]	GraphTools.getMaximumCardinalityOrdering(Graph graph)	Perform Tarjan and Yannakakis (1984) maximum cardinality search (MCS) to get the maximum cardinality ordering.
static Graph	GraphTools.moralize(Graph graph)	Create a moral graph.
void	EmBayesProperties.setGraph(Graph graph)

Constructors in edu.cmu.tetrad.bayes with parameters of type Graph

Modifier	Constructor	Description
	BayesPm(Graph graph)	Construct a new BayesPm using the given DAG, assigning each variable two values named "value1" and "value2" unless nodes are discrete variables with categories already defined.
	BayesPm(Graph graph, int lowerBound, int upperBound)	Constructs a new BayesPm from the given DAG, assigning each variable a random number of values between lowerBound and upperBound.
	BayesPm(Graph graph, BayesPm oldBayesPm)	Constructs a new BayesPm using a given DAG, using as much information from the old BayesPm as possible.
	BayesPm(Graph graph, BayesPm oldBayesPm, int lowerBound, int upperBound)	Constructs a new BayesPm from the given DAG, using as much information from the old BayesPm as possible.
	EmBayesProperties(DataSet dataSet, Graph graph)
	JunctionTreeAlgorithm(Graph graph, DataModel dataModel)

Uses of Graph in edu.cmu.tetrad.calibration

Methods in edu.cmu.tetrad.calibration that return Graph

Modifier and Type	Method	Description
Graph	DataForCalibrationRfci.learnBNRFCI(DataSet bootstrapSample, int depth, Graph truePag)
Graph	DataForCalibrationRfci.makeDAG(int numVars, double edgesPerNode, int numLatentConfounders)

Methods in edu.cmu.tetrad.calibration with parameters of type Graph

Modifier and Type	Method	Description
Graph	DataForCalibrationRfci.learnBNRFCI(DataSet bootstrapSample, int depth, Graph truePag)

Uses of Graph in edu.cmu.tetrad.data

Methods in edu.cmu.tetrad.data that return Graph

Modifier and Type	Method	Description
Graph	KnowledgeBoxInput.getResultGraph()
Graph	KnowledgeBoxInput.getSourceGraph()
static Graph	DataGraphUtils.randomBifactorModel(int numStructuralNodes, int numStructuralEdges, int numMeasurementsPerLatent, int numLatentMeasuredImpureParents, int numMeasuredMeasuredImpureParents, int numMeasuredMeasuredImpureAssociations)	First a random single factor model is created with the specified number of latent nodes and latent edges, and impurity structure.
static Graph	DataGraphUtils.randomMim(Graph graph, int numMeasurementsPerLatent, int numLatentMeasuredImpureParents, int numMeasuredMeasuredImpureParents, int numMeasuredMeasuredImpureAssociations, boolean arrangeGraph)
static Graph	DataGraphUtils.randomSingleFactorModel(int numStructuralNodes, int numStructuralEdges, int numMeasurementsPerLatent, int numLatentMeasuredImpureParents, int numMeasuredMeasuredImpureParents, int numMeasuredMeasuredImpureAssociations)

Methods in edu.cmu.tetrad.data with parameters of type Graph

Modifier and Type	Method	Description
boolean	Knowledge.isViolatedBy(Graph graph)
static Graph	DataGraphUtils.randomMim(Graph graph, int numMeasurementsPerLatent, int numLatentMeasuredImpureParents, int numMeasuredMeasuredImpureParents, int numMeasuredMeasuredImpureAssociations, boolean arrangeGraph)

Constructors in edu.cmu.tetrad.data with parameters of type Graph

Modifier	Constructor	Description
	IndependenceFacts(Graph graph)

Uses of Graph in edu.cmu.tetrad.data.simulation

Methods in edu.cmu.tetrad.data.simulation that return Graph

Modifier and Type	Method	Description
Graph	LoadContinuousDataAndGraphs.getTrueGraph(int index)
Graph	LoadContinuousDataAndSingleGraph.getTrueGraph(int index)
Graph	LoadContinuousDataSmithSim.getTrueGraph(int index)
Graph	LoadDataAndGraphs.getTrueGraph(int index)
Graph	LoadDataFromFileWithoutGraph.getTrueGraph(int index)
Graph	LoadContinuousDataSmithSim.readGraph(File file)

Uses of Graph in edu.cmu.tetrad.graph

Classes in edu.cmu.tetrad.graph that implement Graph

Modifier and Type	Class	Description
final class	Dag	Represents a directed acyclic graph--that is, a graph containing only directed edges, with no cycles.
class	EdgeListGraph	Stores a graph a list of lists of edges adjacent to each node in the graph, with an additional list storing all of the edges in the graph.
class	LagGraph	Implements a graph allowing nodes in the getModel time lag to have parents taken from previous time lags.
final class	SemGraph	Represents the graphical structure of a structural equation model.
class	TimeLagGraph	Represents a time series graph--that is, a graph with a fixed number S of lags, with edges into initial lags only--that is, into nodes in the first R lags, for some R.

Methods in edu.cmu.tetrad.graph that return Graph

Modifier and Type	Method	Description
static Graph	GraphUtils.bidirectedToUndirected(Graph graph)
static Graph	GraphUtils.completeGraph(Graph graph)
static Graph	GraphUtils.convert(String spec)	Converts a string spec of a graph--for example, "X1-->X2, X1---X3, X2o->X4, X3<->X4" to a Graph.
static Graph	GraphUtils.emptyGraph(int numNodes)
static Graph	GraphUtils.getComparisonGraph(Graph graph, Parameters params)
Graph	RandomGraph.UniformGraphGenerator.getDag()
Graph	RandomGraph.UniformGraphGenerator.getDag(List<Node> nodes)
Graph	GraphGroup.getGraph(int g)	Gets a graph at a specific index
static Graph	GraphPersistence.loadGraph(File file)
static Graph	GraphPersistence.loadGraphBNTPcMatrix(List<Node> vars, DataSet dataSet)
static Graph	GraphPersistence.loadGraphJson(File file)
static Graph	GraphPersistence.loadGraphPcalg(File file)
static Graph	GraphPersistence.loadGraphRuben(File file)
static Graph	GraphPersistence.loadGraphTxt(File file)
static Graph	GraphPersistence.loadRSpecial(File file)
static Graph	GraphUtils.markovBlanketDag(Node target, Graph dag)	Calculates the Markov blanket of a target in a DAG.
static Graph	GraphPersistence.parseGraphXml(nu.xom.Element graphElement, Map<String,Node> nodes)
static Graph	RandomGraph.randomCyclicGraph2(int numNodes, int numEdges, int maxDegree)	Makes a cyclic graph by repeatedly adding cycles of length of 3, 4, or 5 to the graph, then finally adding two cycles.
static Graph	RandomGraph.randomCyclicGraph3(int numNodes, int numEdges, int maxDegree, double probCycle, double probTwoCycle)	Makes a cyclic graph by repeatedly adding cycles of length of 3, 4, or 5 to the graph, then finally adding two cycles.
static Graph	RandomGraph.randomDag(int numNodes, int numLatentConfounders, int maxNumEdges, int maxDegree, int maxIndegree, int maxOutdegree, boolean connected)
static Graph	RandomGraph.randomGraph(int numNodes, int numLatentConfounders, int numEdges, int maxDegree, int maxIndegree, int maxOutdegree, boolean connected)
static Graph	RandomGraph.randomGraph(List<Node> nodes, int numLatentConfounders, int maxNumEdges, int maxDegree, int maxIndegree, int maxOutdegree, boolean connected)	Defaults to random forward graphs.
static Graph	RandomGraph.randomGraphRandomForwardEdges(int numNodes, int numLatentConfounders, int numEdges, int maxDegree, int maxIndegree, int maxOutdegree, boolean connected)
static Graph	RandomGraph.randomGraphRandomForwardEdges(List<Node> nodes, int numLatentConfounders, int numEdges, int maxDegree, int maxIndegree, int maxOutdegree, boolean connected)
static Graph	RandomGraph.randomGraphRandomForwardEdges(List<Node> nodes, int numLatentConfounders, int numEdges, int maxDegree, int maxIndegree, int maxOutdegree, boolean connected, boolean layoutAsCircle)
static Graph	RandomGraph.randomGraphUniform(List<Node> nodes, int numLatentConfounders, int maxNumEdges, int maxDegree, int maxIndegree, int maxOutdegree, boolean connected, int numIterations)
static Graph	RandomGraph.randomScaleFreeGraph(int numNodes, int numLatentConfounders, double alpha, double beta, double delta_in, double delta_out)
static Graph	GraphPersistence.readerToGraphJson(Reader reader)
static Graph	GraphPersistence.readerToGraphRuben(Reader reader)
static Graph	GraphPersistence.readerToGraphTxt(Reader reader)
static Graph	GraphPersistence.readerToGraphTxt(String graphString)
static Graph	GraphUtils.removeBidirectedEdges(Graph estCpdag)
static Graph	GraphUtils.removeBidirectedOrientations(Graph estCpdag)
static Graph	GraphUtils.replaceNodes(Graph originalGraph, List<Node> newVariables)	Converts the given graph, originalGraph, to use the new variables (with the same names as the old).
static Graph	GraphUtils.restrictToMeasured(Graph graph)
Graph	Dag.subgraph(List<Node> nodes)
Graph	EdgeListGraph.subgraph(List<Node> nodes)
Graph	Graph.subgraph(List<Node> nodes)	Constructs and returns a subgraph consisting of a given subset of the nodes of this graph together with the edges between them.
Graph	LagGraph.subgraph(List<Node> nodes)
Graph	SemGraph.subgraph(List<Node> nodes)
Graph	TimeLagGraph.subgraph(List<Node> nodes)
static Graph	GraphUtils.undirectedGraph(Graph graph)
static Graph	GraphUtils.undirectedToBidirected(Graph graph)

Methods in edu.cmu.tetrad.graph with parameters of type Graph

Modifier and Type	Method	Description
static void	GraphUtils.addForbiddenReverseEdgesForDirectedEdges(Graph graph, Knowledge knowledge)
void	GraphGroup.addGraph(Graph g)	Adds a graph to the class.
static void	GraphUtils.addPagColoring(Graph graph)
static void	RandomGraph.addTwoCycles(Graph graph, int numTwoCycles)
static List<Edge>	GraphUtils.adjacenciesComplement(Graph graph1, Graph graph2)
static boolean	GraphUtils.allAdjacenciesAreDirected(Node node, Graph graph)
boolean	Triple.alongPathIn(Graph graph)
static void	LayoutUtil.arrangeByLayout(Graph graph, HashMap<String,PointXy> layout)
static boolean	LayoutUtil.arrangeBySourceGraph(Graph resultGraph, Graph sourceGraph)	Arranges the nodes in the result graph according to their positions in the source graph.
static Graph	GraphUtils.bidirectedToUndirected(Graph graph)
static void	LayoutUtil.circleLayout(Graph graph, int centerx, int centery, int radius)	Arranges the nodes in the graph in a circle.
static Graph	GraphUtils.completeGraph(Graph graph)
static boolean	GraphUtils.containsBidirectedEdge(Graph graph)
static nu.xom.Element	GraphPersistence.convertToXml(Graph graph)
static int	GraphUtils.countAdjErrors(Graph graph1, Graph graph2)	Counts the adjacencies that are in graph1 but not in graph2.
static int	GraphUtils.countArrowptErrors(Graph graph1, Graph graph2)	Counts the arrowpoints that are in graph1 but not in graph2.
static int	GraphUtils.degree(Graph graph)
static Set<Node>	GraphUtils.district(Node x, Graph G)
static int[][]	GraphUtils.edgeMisclassificationCounts(Graph leftGraph, Graph topGraph, boolean print)
static String	MisclassificationUtils.edgeMisclassifications(Graph estGraph, Graph refGraph)
static String	MisclassificationUtils.endpointMisclassification(Graph estGraph, Graph refGraph)
static void	RandomGraph.fixLatents1(int numLatentConfounders, Graph graph)
static void	RandomGraph.fixLatents4(int numLatentConfounders, Graph graph)
static void	LayoutUtil.fruchtermanReingoldLayout(Graph graph)
static List<Triple>	GraphUtils.getAmbiguousTriplesFromGraph(Node node, Graph graph)
static Node	GraphUtils.getAssociatedNode(Node errorNode, Graph graph)
static List<Triple>	GraphPersistence.getCollidersFromGraph(Node node, Graph graph)
static Graph	GraphUtils.getComparisonGraph(Graph graph, Parameters params)
static int	GraphUtils.getDegree(Graph graph)
static List<Triple>	GraphUtils.getDottedUnderlinedTriplesFromGraph(Node node, Graph graph)
static int	GraphUtils.getIndegree(Graph graph)
static List<Triple>	GraphUtils.getNoncollidersFromGraph(Node node, Graph graph)
static int	GraphUtils.getNumCorrectArrowpts(Graph correct, Graph estimated)
static GraphUtils.TwoCycleErrors	GraphUtils.getTwoCycleErrors(Graph trueGraph, Graph estGraph)
static List<Triple>	GraphUtils.getUnderlinedTriplesFromGraph(Node node, Graph graph)
static void	GraphUtils.gfciExtraEdgeRemovalStep(Graph graph, Graph referenceCpdag, List<Node> nodes, SepsetProducer sepsets)	The extra edge removal step for GFCI.
static String	GraphUtils.graphAttributesToText(Graph graph, String title)
static String	GraphUtils.graphEdgesToText(Graph graph, String title)
static String	GraphUtils.graphNodeAttributesToText(Graph graph, String title, char delimiter)
static String	GraphUtils.graphNodesToText(Graph graph, String title, char delimiter)
static String	GraphPersistence.graphRMatrixTxt(Graph graph)
static String	GraphPersistence.graphToDot(Graph graph)	Converts a graph to a Graphviz .dot file
static void	GraphPersistence.graphToDot(Graph graph, File file)
static String	GraphPersistence.graphToLavaan(Graph g)
static String	GraphPersistence.graphToPcalg(Graph g)
static String	GraphUtils.graphToText(Graph graph, boolean doPagColoring)
static String	GraphPersistence.graphToXml(Graph graph)
static boolean	GraphUtils.isClique(Collection<Node> set, Graph graph)
static boolean	GraphUtils.isDag(Graph graph)
boolean	Paths.isSatisfyBackDoorCriterion(Graph graph, Node x, Node y, List<Node> z)	Check to see if a set of variables Z satisfies the back-door criterion relative to node x and node y.
static void	LayoutUtil.kamadaKawaiLayout(Graph graph, boolean randomlyInitialized, double naturalEdgeLength, double springConstant, double stopEnergy)
static LinkedList<Triple>	GraphUtils.listColliderTriples(Graph graph)
static String	GraphPersistence.loadGraphRMatrix(Graph graph)
static Graph	GraphUtils.markovBlanketDag(Node target, Graph dag)	Calculates the Markov blanket of a target in a DAG.
static Set<Set<Node>>	GraphUtils.maximalCliques(Graph graph, List<Node> nodes)
static int	GraphUtils.numBidirected(Graph result)
static int	GraphUtils.numDirectionalErrors(Graph result, Graph cpdag)
static Set<Node>	GraphUtils.pagMb(Node x, Graph G)
static String	GraphUtils.pathString(Graph graph, Node... x)
static String	GraphUtils.pathString(Graph graph, List<Node> path)
static String	Triple.pathString(Graph graph, Node x, Node y, Node z)
static Graph	GraphUtils.removeBidirectedEdges(Graph estCpdag)
static Graph	GraphUtils.removeBidirectedOrientations(Graph estCpdag)
static void	GraphUtils.removeNonSkeletonEdges(Graph graph, Knowledge knowledge)
static Graph	GraphUtils.replaceNodes(Graph originalGraph, List<Node> newVariables)	Converts the given graph, originalGraph, to use the new variables (with the same names as the old).
static List<Node>	GraphUtils.replaceNodes(List<Node> originalNodes, Graph graph)	Converts the given list of nodes, originalNodes, to use the replacement nodes for them by the same name in the given graph.
static Graph	GraphUtils.restrictToMeasured(Graph graph)
static void	GraphUtils.retainUnshieldedColliders(Graph graph, Knowledge knowledge)	Retains only the unshielded colliders of the given graph.
static PrintWriter	GraphPersistence.saveGraph(Graph graph, File file, boolean xml)
void	Dag.transferAttributes(Graph graph)
void	EdgeListGraph.transferAttributes(Graph graph)
void	Graph.transferAttributes(Graph graph)
void	LagGraph.transferAttributes(Graph graph)
void	SemGraph.transferAttributes(Graph graph)
void	TimeLagGraph.transferAttributes(Graph graph)
void	Dag.transferNodesAndEdges(Graph graph)
void	EdgeListGraph.transferNodesAndEdges(Graph graph)	Transfers nodes and edges from one graph to another.
void	Graph.transferNodesAndEdges(Graph graph)	Transfers nodes and edges from one graph to another.
void	LagGraph.transferNodesAndEdges(Graph graph)
void	SemGraph.transferNodesAndEdges(Graph graph)
void	TimeLagGraph.transferNodesAndEdges(Graph graph)
static Graph	GraphUtils.undirectedGraph(Graph graph)
static Graph	GraphUtils.undirectedToBidirected(Graph graph)

Method parameters in edu.cmu.tetrad.graph with type arguments of type Graph

Modifier and Type	Method	Description
static String	GraphUtils.getIntersectionComparisonString(List<Graph> graphs)

Constructors in edu.cmu.tetrad.graph with parameters of type Graph

Modifier	Constructor	Description
	Dag(Graph graph)	Constructs a new directed acyclic graph from the given graph object.
	EdgeListGraph(Graph graph)	Constructs a EdgeListGraph using the nodes and edges of the given graph.
	FruchtermanReingoldLayout(Graph graph)
	KamadaKawaiLayout(Graph graph)
	Paths(Graph graph)
	SemGraph(Graph graph)	Constructs a new SemGraph from the nodes and edges of the given graph.
	Underlines(Graph graph)

Uses of Graph in edu.cmu.tetrad.performance

Methods in edu.cmu.tetrad.performance that return Graph

Modifier and Type	Method	Description
Graph	ComparisonResult.getCorrectResult()
Graph	ComparisonResult.getResultGraph()
Graph	ComparisonResult.getTrueDag()

Methods in edu.cmu.tetrad.performance with parameters of type Graph

Modifier and Type	Method	Description
static String	PerformanceTests.endpointMisclassification(List<Node> _nodes, Graph estGraph, Graph refGraph)
static Knowledge	Comparison2.getKnowledge(Graph graph)
void	ComparisonResult.setCorrectResult(Graph correctResult)
void	ComparisonResult.setResultGraph(Graph graph)
void	ComparisonResult.setTrueDag(Graph trueDag)

Uses of Graph in edu.cmu.tetrad.regression

Methods in edu.cmu.tetrad.regression that return Graph

Modifier and Type	Method	Description
Graph	Regression.getGraph()
Graph	RegressionCovariance.getGraph()
Graph	RegressionDataset.getGraph()

Methods in edu.cmu.tetrad.regression with parameters of type Graph

Modifier and Type	Method	Description
static DataSet	RegressionUtils.residuals(DataSet dataSet, Graph graph)

Uses of Graph in edu.cmu.tetrad.search

Methods in edu.cmu.tetrad.search that return Graph

Modifier and Type	Method	Description
Graph	GraphChange.applyTo(Graph graph)	Outputs a new PAG, a copy of the input excepting the applied changes of this object.
Graph	DagToPag.convert()
Graph	TsDagToPag.convert()
static Graph	ClusterUtils.convertSearchGraph(List<int[]> clusters, String[] varNames)
static Graph	Purify.convertSearchGraph(SemGraph input)
static Graph	SearchGraphUtils.cpdagForDag(Graph dag)
static Graph	SearchGraphUtils.cpdagFromDag(Graph dag)
static Graph	SearchGraphUtils.dagFromCPDAG(Graph graph)
static Graph	SearchGraphUtils.dagFromCPDAG(Graph graph, Knowledge knowledge)
static @NotNull Graph	SearchGraphUtils.dagToPag(Graph trueGraph)
Graph	Bridges.getAdjacencies()
Graph	Bridges2.getAdjacencies()
Graph	FgesMb.getAdjacencies()
Graph	FgesOrienter.getAdjacencies()
Graph	TsFges2.getAdjacencies()
Graph	TimeSeriesUtils.VarResult.getCollapsedVarGraph()
Graph	DagSepsets.getDag()
Graph	GraphScore.getDag()
Graph	SepsetsGreedy.getDag()
Graph	SepsetsGreedy2.getDag()
Graph	FgesMb.getexternalGraph()
Graph	Cpc.getExternalGraph()
Graph	Fask.getExternalGraph()
Graph	FgesOrienter.getExternalGraph()
Graph	MultiFaskV1.getExternalGraph()
Graph	TsFges2.getExternalGraph()
Graph	Mimbuild.getFullGraph()
Graph	MimbuildTrek.getFullGraph()
@NotNull Graph	BossMb.getGraph()
Graph	BossOrig.getGraph(boolean cpDag)
Graph	Cefs.getGraph()
Graph	Cpc.getGraph()	The graph that's constructed during the search.
Graph	CpcStable.getGraph()	The graph that's constructed during the search.
Graph	GraphWithParameters.getGraph()
@NotNull Graph	Grasp.getGraph(boolean cpDag)
@NotNull Graph	GraspTol.getGraph(boolean cpDag)
Graph	HbmsBeam.getGraph()
Graph	HbsmsGes.getGraph()
Graph	HbsmsGes.GraphWithPValue.getGraph()
Graph	IndTestDSep.getGraph()
Graph	Ling.StoredGraphs.getGraph(int g)
@NotNull Graph	OtherPermAlgs.getGraph(boolean cpDag)
Graph	PcAll.getGraph()	The graph that's constructed during the search.
Graph	PcMb.getGraph()
static Graph	PermutationSearch.getGraph(List<Node> nodes, Map<Node,Set<Node>> parents, boolean cpDag)
static Graph	PermutationSearch.getGraph(List<Node> nodes, Map<Node,Set<Node>> parents, Knowledge knowledge, boolean cpDag)
Graph	SampleVcpc.getGraph()	The graph that's constructed during the search.
Graph	SampleVcpcFast.getGraph()	The graph that's constructed during the search.
Graph	ScoredGraph.getGraph()
Graph	TeyssierScorer.getGraph(boolean cpDag)	Returns the DAG build for the current permutation, or its CPDAG.
Graph	TeyssierScorer2.getGraph(boolean cpDag)	Returns the DAG build for the current permutation, or its CPDAG.
Graph	TeyssierScorerExperimental.getGraph(boolean cpDag)
Graph	TeyssierScorerOpt.getGraph(boolean cpDag)	Returns the DAG build for the current permutation, or its CPDAG.
Graph	Vcpc.getGraph()	The graph that's constructed during the search.
Graph	VcpcAlt.getGraph()	The graph that's constructed during the search.
Graph	VcpcFast.getGraph()	The graph that's constructed during the search.
Graph	MagSemBicScore.getMag()
static Graph	MbUtils.getOneMbDag(Graph mbCPDAG)
Graph	PossibleDConnectingPath.getPag()
Graph	DagToPag.getTruePag()
Graph	FciOrient.getTruePag()	The true PAG if available.
Graph	SvarFciOrient.getTruePag()	The true PAG if available.
Graph	TsDagToPag.getTruePag()
Graph	DMSearch.LatentStructure.latentStructToEdgeListGraph(DMSearch.LatentStructure structure)
Graph	Cstar.makeGraph(List<Cstar.Record> records)	Makes a graph of the estimated predictors to the effect.
Graph	RBExperiments.makeSimpleDAG(int numLatentConfounders)
Graph	DagInCPDAGIterator.next()	Successive calls to this method return successive DAGs in the CPDAG, in a more or less natural enumeration of them in which an arbitrary undirected edge is picked, oriented one way, Meek rules applied, then a remaining unoriented edge is picked, oriented one way, and so on, until a DAG is obtained, and then by backtracking the other orientation of each chosen edge is tried.
Graph	DagIterator.next()	Successive calls to this method return successive DAGs in the CPDAG, in a more or less natural enumeration of them in which an arbitrary undirected edge is picked, oriented one way, Meek rules applied, then a remaining unoriented edge is picked, oriented one way, and so on, until a DAG is obtained, and then by backtracking the other orientation of each chosen edge is tried.
Graph	FciOrient.orient(Graph graph)
Graph	Lofs.orient()
Graph	Lofs2.orient()
Graph	SvarFciOrient.orient(Graph graph)
Graph	TimeSeriesLagSearch.orientationForGraph(Dag trueGraph)	Orients the given graph using CPC orientation with the conditional independence test provided in the constructor.
static Graph	SearchGraphUtils.pagToMag(Graph pag)
Graph	HbmsBeam.removeZeroEdges(Graph bestGraph)
Graph	Cefs.resultGraph()
Graph	PcMb.resultGraph()
Graph	Bdce.search()
Graph	BFci.search()
Graph	BfciFoo.search()
Graph	BfciTr.search()
Graph	BossMb2.search(@NotNull List<Node> order)	Prints local graphs for all variables and returns the one of them.
Graph	BpcTetradPurifyWashdown.search()
Graph	Bridges.search()
Graph	Bridges2.search()
Graph	BridgesOld.search()
Graph	BuildPureClusters.search()
Graph	Ccd.search()	The search method assumes that the IndependenceTest provided to the constructor is a conditional independence oracle for the SEM (or Bayes network) which describes the causal structure of the population.
Graph	CcdMax.search()
Graph	Cefs.search(String targetName)	Searches for the MB CPDAG for the given target.
Graph	Cfci.search()
Graph	Cpc.search()	Runs PC starting with a fully connected graph over all of the variables in the domain of the independence test.
Graph	CpcStable.search()	Runs PC starting with a fully connected graph over all of the variables in the domain of the independence test.
Graph	CpcStable.search(IFas fas, List<Node> nodes)
Graph	CpcStable.search(List<Node> nodes)
Graph	DMSearch.search()
Graph	Fas.search()
Graph	Fas.search(List<Node> nodes)	Discovers all adjacencies in data.
Graph	FasConcurrent.search()	Deprecated. Discovers all adjacencies in data.
Graph	FasConcurrent.search(List<Node> nodes)	Deprecated.
Graph	FasDeterministic.search()	Discovers all adjacencies in data.
Graph	FasDeterministic.search(List<Node> nodes)
Graph	FasFdr.search()	Discovers all adjacencies in data.
Graph	FasFdr.search(List<Node> nodes)
Graph	Fask.search()	Runs the search on the concatenated data, returning a graph, possibly cyclic, possibly with two-cycles.
Graph	FaskVote.search(Parameters parameters)
Graph	FasLofs.search()	Runs the search on the concatenated data, returning a graph, possibly cyclic, possibly with two-cycles.
Graph	FasStableConcurrentFdr.search()	Discovers all adjacencies in data.
Graph	FasStableConcurrentFdr.search(List<Node> nodes)
Graph	Fasts.search()	Discovers all adjacencies in data.
Graph	Fasts.search(List<Node> nodes)
Graph	Fci.search()
Graph	FciMax.search()
Graph	Fges.search()	Greedy equivalence search: Start from the empty graph, add edges till model is significant.
Graph	FgesMb.search(Node target)	Greedy equivalence search: Start from the empty graph, add edges till model is significant.
Graph	FgesMb.search(List<Node> targets)
Graph	FgesOrienter.search()	Greedy equivalence search: Start from the empty graph, add edges till model is significant.
Graph	FindOneFactorClusters.search()
Graph	FindTwoFactorClusters.search()
Graph	GFci.search()
Graph	GraphSearch.search()
Graph	GraspFci.search()
Graph	HbmsBeam.search()
Graph	Hbsms.search()
Graph	HbsmsGes.search()
Graph	IFas.search()
Graph	IFas.search(List<Node> nodes)
Graph	InverseCorrelation.search()
Graph	Kpc.search()	Runs PC starting with a complete graph over all nodes of the given conditional independence test, using the given independence test and knowledge and returns the resultant graph.
Graph	Kpc.search(List<Node> nodes)	Runs PC starting with a commplete graph over the given list of nodes, using the given independence test and knowledge and returns the resultant graph.
Graph	Lingam.search(DataSet data)
Graph	LingamPattern.search()
Graph	LingamPattern2.search()
Graph	Mimbuild.search(List<List<Node>> clustering, List<String> latentNames, ICovarianceMatrix measuresCov)
Graph	MimbuildTrek.search(List<List<Node>> clustering, List<String> latentNames, ICovarianceMatrix measuresCov)
Graph	MultiFaskV1.search()
Graph	Pc.search()	Runs PC starting with a complete graph over all nodes of the given conditional independence test, using the given independence test and knowledge and returns the resultant graph.
Graph	Pc.search(IFas fas, List<Node> nodes)
Graph	Pc.search(List<Node> nodes)	Runs PC starting with a commplete graph over the given list of nodes, using the given independence test and knowledge and returns the resultant graph.
Graph	PcAll.search()
Graph	PcAll.search(List<Node> nodes)
Graph	Pcd.search()	Runs PC starting with a complete graph over all nodes of the given conditional independence test, using the given independence test and knowledge and returns the resultant graph.
Graph	Pcd.search(IFas fas, List<Node> nodes)
Graph	Pcd.search(List<Node> nodes)	Runs PC starting with a commplete graph over the given list of nodes, using the given independence test and knowledge and returns the resultant graph.
Graph	PcLocal.search()	Runs PC starting with a fully connected graph over all of the variables in the domain of the independence test.
Graph	PcMax.search()	Runs PC starting with a complete graph over all nodes of the given conditional independence test, using the given independence test and knowledge and returns the resultant graph.
Graph	PcMax.search(IFas fas, List<Node> nodes)
Graph	PcMax.search(List<Node> nodes)	Runs PC starting with a commplete graph over the given list of nodes, using the given independence test and knowledge and returns the resultant graph.
Graph	PcMb.search()	Does a CPDAG search.
Graph	PcMb.search(List<Node> targets)	Searches for the MB CPDAG for the given targets.
Graph	PcStable.search()	Runs PC starting with a complete graph over all nodes of the given conditional independence test, using the given independence test and knowledge and returns the resultant graph.
Graph	PcStable.search(List<Node> nodes)	Runs PC starting with a commplete graph over the given list of nodes, using the given independence test and knowledge and returns the resultant graph.
Graph	PcStableMax.search()	Runs PC search, returning the output CPDAG.
Graph	PcStableMax.search(List<Node> nodes)	Runs PC search, returning the output CPDAG, over the given nodes.
Graph	PermutationSearch.search()
Graph	Purify.search()	****************************************************** SEARCH INTERFACE *******************************************************
Graph	Rfci.search()
Graph	Rfci.search(IFas fas, List<Node> nodes)
Graph	Rfci.search(List<Node> nodes)
Graph	SampleVcpc.search()
Graph	SampleVcpcFast.search()
Graph	SpFci.search()
Graph	SvarFci.search()
Graph	SvarFci.search(IFas fas)
Graph	SvarGfci.search()
Graph	TimeSeriesLagSearch.search()	Runs PC starting with a fully connected graph over all of the variables in the domain of the independence test.
Graph	TimeSeriesLagSearch.search(List<Node> nodes)	Runs PC on just the given variable, all of which must be in the domain of the independence test.
Graph	TsFges2.search()	Greedy equivalence search: Start from the empty graph, add edges till model is significant.
Graph	Vcfas.search()	Discovers all adjacencies in data.
Graph	Vcpc.search()
Graph	VcpcAlt.search()
Graph	VcpcFast.search()
Graph	Washdown.search()

Methods in edu.cmu.tetrad.search that return types with arguments of type Graph

Modifier and Type	Method	Description
static List<Graph>	SearchGraphUtils.generateCpdagDags(Graph cpdag, boolean orientBidirectedEdges)	Generates the list of DAGs in the given cpdag.
static List<Graph>	MbUtils.generateMbDags(Graph mbCPDAG, boolean orientBidirectedEdges, IndependenceTest test, int depth, Node target)	Generates the list of MB DAGs consistent with the MB CPDAG returned by the previous search.
static List<Graph>	SearchGraphUtils.getAllGraphsByDirectingUndirectedEdges(Graph skeleton)
static List<Graph>	SearchGraphUtils.getDagsInCpdagMeek(Graph cpdag, Knowledge knowledge)
@NotNull List<Graph>	BossMb2.getGraphs()
List<Graph>	Dci.search()	Begins the DCI search procedure, described at each step
List<Graph>	Ion.search()	Begins the ION search procedure, described at each step
List<Graph>	Ion2.search()	Begins the ION search procedure, described at each step

Methods in edu.cmu.tetrad.search with parameters of type Graph

Modifier and Type	Method	Description
void	Ling.StoredGraphs.addGraph(Graph g)	Gives a method for adding classes to the class.
DMSearch.LatentStructure	DMSearch.applyDmSearch(Graph pattern, Set<String> inputString, double penalty)
Graph	GraphChange.applyTo(Graph graph)	Outputs a new PAG, a copy of the input excepting the applied changes of this object.
static void	SearchGraphUtils.arrangeByKnowledgeTiers(Graph graph)
static void	SearchGraphUtils.arrangeByKnowledgeTiers(Graph graph, Knowledge knowledge)
static void	SearchGraphUtils.basicCPDAG(Graph graph)	Get a graph and direct only the unshielded colliders.
static void	SearchGraphUtils.basicCpdagRestricted2(Graph graph, Node node)
void	Bes.bes(Graph graph, List<Node> variables)
void	LvBesJoe.bes(Graph graph, List<Node> variables)
void	PermutationBes.bes(Graph graph, List<Node> order, List<Node> suborder)
static Clusters	MimUtils.convertToClusters(Graph clusterGraph)
static Clusters	MimUtils.convertToClusters(Graph clusterGraph, List<Node> measuredVariables)	Converts a disconnected multiple indicator model into a set of clusters.
static List<List<Node>>	MimUtils.convertToClusters2(Graph clusterGraph)
static Graph	SearchGraphUtils.cpdagForDag(Graph dag)
static Graph	SearchGraphUtils.cpdagFromDag(Graph dag)
static Graph	SearchGraphUtils.dagFromCPDAG(Graph graph)
static Graph	SearchGraphUtils.dagFromCPDAG(Graph graph, Knowledge knowledge)
static @NotNull Graph	SearchGraphUtils.dagToPag(Graph trueGraph)
void	FciOrient.ddpOrient(Node a, Node b, Node c, Graph graph)	a method to search "back from a" to find a DDP.
void	SvarFciOrient.ddpOrient(Node a, Node b, Node c, Graph graph)	a method to search "back from a" to find a DDP.
void	FciOrient.doFinalOrientation(Graph graph)	Orients the graph according to rules in the graph (FCI step D).
void	SvarFciOrient.doFinalOrientation(Graph graph)	Orients the graph according to rules in the graph (FCI step D).
static boolean	DagToPag.existsInducingPathInto(Node x, Node y, Graph graph)
static boolean	TsDagToPag.existsInducingPathInto(Node x, Node y, Graph graph, Knowledge knowledge)
static boolean	TsDagToPag.existsInducingPathVisitts(Graph graph, Node a, Node b, Node x, Node y, LinkedList<Node> path, Knowledge knowledge)
static boolean	SearchGraphUtils.existsLocalSepsetWithout(Node x, Node y, Node z, IndependenceTest test, Graph graph, int depth)
void	FciOrient.fciOrientbk(Knowledge bk, Graph graph, List<Node> variables)	Orients according to background knowledge
static List<PossibleDConnectingPath>	PossibleDConnectingPath.findDConnectingPaths(Graph pag, Node x, Node y, Collection<Node> z)	Finds all possible D-connection undirectedPaths as sub-graphs of the pag given at construction time from x to y given z.
static List<PossibleDConnectingPath>	PossibleDConnectingPath.findDConnectingPathsOfLength(Graph pag, Node x, Node y, Collection<Node> z, Integer length)	Finds all possible D-connection undirectedPaths as sub-graphs of the pag given at construction time from x to y given z for a particular path length.
static void	SampleVcpc.futureNodeVisit(Graph graph, Node b, LinkedList<Node> path, Set<Node> futureNodes)
static void	SampleVcpcFast.futureNodeVisit(Graph graph, Node b, LinkedList<Node> path, Set<Node> futureNodes)
static void	Vcpc.futureNodeVisit(Graph graph, Node b, LinkedList<Node> path, Set<Node> futureNodes)
static void	VcpcAlt.futureNodeVisit(Graph graph, Node b, LinkedList<Node> path, Set<Node> futureNodes)
static void	VcpcFast.futureNodeVisit(Graph graph, Node b, LinkedList<Node> path, Set<Node> futureNodes)
static List<Graph>	SearchGraphUtils.generateCpdagDags(Graph cpdag, boolean orientBidirectedEdges)	Generates the list of DAGs in the given cpdag.
static List<Graph>	MbUtils.generateMbDags(Graph mbCPDAG, boolean orientBidirectedEdges, IndependenceTest test, int depth, Node target)	Generates the list of MB DAGs consistent with the MB CPDAG returned by the previous search.
static List<Graph>	SearchGraphUtils.getAllGraphsByDirectingUndirectedEdges(Graph skeleton)
static SearchGraphUtils.CpcTripleType	SearchGraphUtils.getCpcTripleType(Node x, Node y, Node z, IndependenceTest test, int depth, Graph graph)
static List<Graph>	SearchGraphUtils.getDagsInCpdagMeek(Graph cpdag, Knowledge knowledge)
static GraphUtils.GraphComparison	SearchGraphUtils.getGraphComparison(Graph trueGraph, Graph targetGraph)
static GraphUtils.GraphComparison	SearchGraphUtils.getGraphComparison2(Graph graph, Graph trueGraph)	Just counts arrowpoint errors--for cyclic edges counts an arrowpoint at each node.
static Knowledge	TimeSeriesUtils.getKnowledge(Graph graph)
List<Node>	Bridges.getNeighbors(Graph graph, Node node)
static Graph	MbUtils.getOneMbDag(Graph mbCPDAG)
Vcpc.CpcTripleType	Vcpc.getPopulationTripleType(Node x, Node y, Node z, IndependenceTest test, int depth, Graph graph, boolean verbose)
VcpcFast.CpcTripleType	VcpcFast.getPopulationTripleType(Node x, Node y, Node z, IndependenceTest test, int depth, Graph graph, boolean verbose)
static Set<Node>	SearchGraphUtils.getReachableNodes(List<Node> initialNodes, LegalPairs legalPairs, List<Node> c, List<Node> d, Graph graph, int maxPathLength)
double	FgesMb.getScore(Graph dag)
double	FgesOrienter.getScore(Graph dag)
double	TsFges2.getScore(Graph dag)
static int[][]	SearchGraphUtils.graphComparison(Graph trueCpdag, Graph estCpdag, PrintStream out)
static String	SearchGraphUtils.graphComparisonString(String trueGraphName, Graph trueGraph, String targetGraphName, Graph targetGraph, boolean printStars)
static boolean	PagUtils.graphInPagStep0(Graph pag, Graph dag)	This method implements step (1) of the definition.
static boolean	PagUtils.graphInPagStep1(Graph pag, Graph dag)
static boolean	PagUtils.graphInPagStep2(Graph pag, Graph dag)
static boolean	PagUtils.graphInPagStep3(Graph pag, Graph dag)
static boolean	PagUtils.graphInPagStep4(Graph pag, Graph dag)
static boolean	PagUtils.graphInPagStep5(Graph pag, Graph dag)
static TimeLagGraph	TimeSeriesUtils.graphToLagGraph(Graph _graph, int numLags)
static boolean	FciOrient.isArrowpointAllowed(Node x, Node y, Graph graph, Knowledge knowledge)
static SearchGraphUtils.LegalPagRet	SearchGraphUtils.isLegalPag(Graph pag)
Map<Edge,Double>	TsFges2.logEdgeBayesFactors(Graph dag)
String	Bridges.logEdgeBayesFactorsString(Graph dag)
String	Fges.logEdgeBayesFactorsString(Graph dag)
String	TsFges2.logEdgeBayesFactorsString(Graph dag)
boolean	MeekRulesCpdag.meekR1Locally(Graph graph, Knowledge Knowledge)
static boolean	SearchGraphUtils.meekR1Locally(Graph graph, Knowledge knowledge, IndependenceTest test, int depth)	Orient away from collider.
boolean	MeekRulesCpdag.meekR2(Graph graph, Knowledge Knowledge)
static boolean	SearchGraphUtils.meekR2(Graph graph, Knowledge knowledge)	If
boolean	MeekRulesCpdag.meekR3(Graph graph, Knowledge Knowledge)	Meek's rule R3.
static boolean	SearchGraphUtils.meekR3(Graph graph, Knowledge knowledge)	Meek's rule R3.
boolean	MeekRulesCpdag.meekR4(Graph graph, Knowledge Knowledge)
static boolean	SearchGraphUtils.meekR4(Graph graph, Knowledge knowledge)
static Clusters	ClusterUtils.mimClusters(Graph mim)
void	BFci.modifiedR0(Graph fgesGraph, SepsetProducer sepsets)
void	GFci.modifiedR0(Graph fgesGraph, SepsetProducer sepsets)
void	GraspFci.modifiedR0(Graph fgesGraph, SepsetProducer sepsets)
void	SpFci.modifiedR0(Graph fgesGraph, SepsetProducer sepsets)
void	SvarGfci.modifiedR0(Graph fgesGraph)
void	CpcOrienter.orient(Graph graph)	Runs PC on just the given variable, all of which must be in the domain of the independence test.
Graph	FciOrient.orient(Graph graph)
void	FgesOrienter.orient(Graph graph)
void	OrientCollidersMaxP.orient(Graph graph)	Searches for a PAG satisfying the description in Thomas Richardson (1997), dissertation, Carnegie Mellon University.
void	Reorienter.orient(Graph graph)	Globally reorients the graph.
Graph	SvarFciOrient.orient(Graph graph)
void	BossOrig.orientbk(Knowledge bk, Graph graph, List<Node> variables)
static void	OrientCollidersMaxP.orientCollider(Node x, Node y, Node z, PcAll.ConflictRule conflictRule, Graph graph)
static void	SearchGraphUtils.orientCollidersUsingSepsets(SepsetMap set, Knowledge knowledge, Graph graph, boolean verbose, boolean enforceCpdag)	Step C of PC; orients colliders using specified sepset.
Set<Node>	ImpliedOrientation.orientImplied(Graph graph)	Adds implied orientations.
Set<Node>	MeekRules.orientImplied(Graph graph)
Set<Node>	MeekRulesCpdag.orientImplied(Graph graph)
Set<Node>	MeekRulesRestricted.orientImplied(Graph graph)
void	MeekRulesRestricted.orientImplied(Graph graph, Set<Node> nodes)
void	MeekRulesCpdag.orientUsingMeekRulesLocally(Knowledge Knowledge, Graph graph)
static void	SearchGraphUtils.orientUsingMeekRulesLocally(Knowledge knowledge, Graph graph, IndependenceTest test, int depth)	Orients using Meek rules, double checking noncolliders locally.
static Graph	SearchGraphUtils.pagToMag(Graph pag)
static void	SearchGraphUtils.pcdOrientC(IndependenceTest test, Knowledge knowledge, Graph graph)	Performs step C of the algorithm, as indicated on page xxx of CPS, with the modification that X--W--Y is oriented as X-->W<--Y if W is *determined by* the sepset of (X, Y), rather than W just being *in* the sepset of (X, Y).
static void	SearchGraphUtils.pcOrientbk(Knowledge bk, Graph graph, List<Node> nodes)	Orients according to background knowledge.
static GraphWithParameters	GraphWithParameters.regress(DataSet dataSet, Graph graph)	creates a CPDAGWithParameters by running a regression, given a graph and data
Graph	HbmsBeam.removeZeroEdges(Graph bestGraph)
void	MeekRules.revertToUnshieldedColliders(List<Node> nodes, Graph graph, Set<Node> visited)
void	FciOrient.ruleR0(Graph graph)	Orients colliders in the graph.
void	SvarFciOrient.ruleR0(Graph graph)	Orients colliders in the graph.
void	FciOrient.ruleR3(Graph graph)	Implements the double-triangle orientation rule, which states that if D*-oB, A*->B<-*C and A*-oDo-*C, and !adj(a, c), D*-oB, then D*->B.
void	SvarFciOrient.ruleR3(Graph graph)	Implements the double-triangle orientation rule, which states that if D*-oB, A*->B<-*C and A*-oDo-*C, then D*->B.
void	FciOrient.ruleR4B(Graph graph)	The triangles that must be oriented this way (won't be done by another rule) all look like the ones below, where the dots are a collider path from L to A with each node on the path (except L) a parent of C.
void	SvarFciOrient.ruleR4B(Graph graph)	The triangles that must be oriented this way (won't be done by another rule) all look like the ones below, where the dots are a collider path from L to A with each node on the path (except L) a parent of C.
void	FciOrient.ruleR5(Graph graph)	Implements Zhang's rule R5, orient circle undirectedPaths: for any Ao-oB, if there is an uncovered circle path u = [A,C,...,D,B] such that A,D nonadjacent and B,C nonadjacent, then A---B and orient every edge on u undirected.
void	SvarFciOrient.ruleR5(Graph graph)	Implements Zhang's rule R5, orient circle undirectedPaths: for any Ao-oB, if there is an uncovered circle path u = [A,C,...,D,B] such that A,D nonadjacent and B,C nonadjacent, then A---B and orient every edge on u undirected.
void	FciOrient.ruleR6R7(Graph graph)	Implements Zhang's rules R6 and R7, applies them over the graph once.
void	SvarFciOrient.ruleR6R7(Graph graph)	Implements Zhang's rules R6 and R7, applies them over the graph once.
void	FciOrient.rulesR1R2cycle(Graph graph)
void	SvarFciOrient.rulesR1R2cycle(Graph graph)
void	FciOrient.rulesR8R9R10(Graph graph)	Implements Zhang's rules R8, R9, R10, applies them over the graph once.
void	SvarFciOrient.rulesR8R9R10(Graph graph)	Implements Zhang's rules R8, R9, R10, applies them over the graph once.
double	Bridges.scoreDag(Graph dag)
double	Bridges2.scoreDag(Graph dag)
double	Fges.scoreDag(Graph dag)
double	FgesMb.scoreDag(Graph dag)	Scores the given DAG, up to a constant.
double	FgesOrienter.scoreDag(Graph dag)	Scores the given DAG, up to a constant.
double	GraphScorer.scoreDag(Graph dag)
HbsmsGes.Score	HbsmsGes.scoreDag(Graph dag)
static double	SemBicScorer.scoreDag(Graph dag, DataModel data)
static double	SemBicScorer.scoreDag(Graph dag, DataModel data, boolean precomputeCovariances)
double	TsFges2.scoreDag(Graph dag)	Scores the given DAG, up to a constant.
HbmsBeam.Score	HbmsBeam.scoreGraph(Graph graph)
HbsmsGes.Score	HbsmsGes.scoreGraph(Graph graph)
Set<Node>	Bridges.search2(Graph graph, List<Node> variables)	Greedy equivalence search: Start from the empty graph, add edges till model is significant.
void	Bridges.setAdjacencies(Graph adjacencies)	Sets the set of preset adjacenies for the algorithm; edges not in this adjacencies graph will not be added.
void	Bridges2.setAdjacencies(Graph adjacencies)	Sets the set of preset adjacenies for the algorithm; edges not in this adjacencies graph will not be added.
void	FgesMb.setAdjacencies(Graph adjacencies)	Sets the set of preset adjacenies for the algorithm; edges not in this adjacencies graph will not be added.
void	FgesOrienter.setAdjacencies(Graph adjacencies)	Sets the set of preset adjacenies for the algorithm; edges not in this adjacencies graph will not be added.
void	TsFges2.setAdjacencies(Graph adjacencies)	Sets the set of preset adjacenies for the algorithm; edges not in this adjacencies graph will not be added.
void	Bridges.setBoundGraph(Graph boundGraph)	If non-null, edges not adjacent in this graph will not be added.
void	Fges.setBoundGraph(Graph boundGraph)	If non-null, edges not adjacent in this graph will not be added.
void	TsFges2.setBoundGraph(Graph boundGraph)	If non-null, edges not adjacent in this graph will not be added.
void	Cpc.setExternalGraph(Graph externalGraph)
void	FasDeterministic.setExternalGraph(Graph externalGraph)
void	Fask.setExternalGraph(Graph externalGraph)
void	FasStableConcurrentFdr.setExternalGraph(Graph externalGraph)
void	Fasts.setExternalGraph(Graph externalGraph)
void	FgesMb.setExternalGraph(Graph externalGraph)	Sets the initial graph.
void	FgesOrienter.setExternalGraph(Graph externalGraph)	Sets the initial graph.
void	MultiFaskV1.setExternalGraph(Graph externalGraph)
void	PcAll.setExternalGraph(Graph externalGraph)
void	PcLocal.setExternalGraph(Graph externalGraph)
void	TsFges2.setExternalGraph(Graph externalGraph)	Sets the initial graph.
void	Vcfas.setExternalGraph(Graph externalGraph)
void	Cpc.setGraph(Graph graph)
void	CpcStable.setGraph(Graph graph)
void	IndTestDSep.setGraph(Graph graph)
void	PcAll.setGraph(Graph graph)
void	SampleVcpc.setGraph(Graph graph)
void	SampleVcpcFast.setGraph(Graph graph)
void	Vcpc.setGraph(Graph graph)
void	VcpcAlt.setGraph(Graph graph)
void	VcpcFast.setGraph(Graph graph)
void	Fges.setInitialGraph(Graph initialGraph)	Sets the initial graph.
void	MagSemBicScore.setMag(Graph mag)
void	TeyssierScorerExperimental.setOrder(Graph graph)
void	FgesMb.setTrueGraph(Graph trueGraph)	If the true graph is set, askterisks will be printed in log output for the true edges.
void	FgesOrienter.setTrueGraph(Graph trueGraph)	If the true graph is set, askterisks will be printed in log output for the true edges.
void	IPurify.setTrueGraph(Graph mim)
void	PurifyScoreBased.setTrueGraph(Graph mim)
void	PurifyTetradBased.setTrueGraph(Graph mim)
void	PurifyTetradBased2.setTrueGraph(Graph mim)
void	TsFges2.setTrueGraph(Graph trueGraph)	If the true graph is set, askterisks will be printed in log output for the true edges.
void	DagToPag.setTruePag(Graph truePag)
void	FciOrient.setTruePag(Graph truePag)
void	SvarFciOrient.setTruePag(Graph truePag)
void	TsDagToPag.setTruePag(Graph truePag)
static int	SearchGraphUtils.structuralHammingDistance(Graph trueGraph, Graph estGraph)	Tsamardinos, I., Brown, L.
static List<List<Node>>	Ion.treks(Graph graph, Node node1, Node node2)
static List<List<Node>>	Ion2.treks(Graph graph, Node node1, Node node2)
static void	MbUtils.trimEdgesAmongParents(Graph graph, Node target)	Removes edges among the parents of the target.
static void	MbUtils.trimEdgesAmongParentsOfChildren(Graph graph, Node target)	Removes edges among the parents of children of the target.
static void	MbUtils.trimToAdjacents(Graph graph, Node target)
static void	MbUtils.trimToMbNodes(Graph graph, Node target, boolean includeBidirected)	Trims the graph to the target, the parents and children of the target, and the parents of the children of the target.
double	Ida.trueEffect(Node x, Node y, Graph trueDag)

Constructors in edu.cmu.tetrad.search with parameters of type Graph

Modifier	Constructor	Description
	DagInCPDAGIterator(Graph CPDAG)
	DagInCPDAGIterator(Graph CPDAG, Knowledge knowledge)
	DagInCPDAGIterator(Graph CPDAG, Knowledge knowledge, boolean allowArbitraryOrientations, boolean allowNewColliders)	The given CPDAG must be a CPDAG.
	DagIterator(Graph CPDAG)	The given CPDAG must be a CPDAG.
	DagSepsets(Graph dag)
	DagToPag(Graph dag)	Constructs a new FCI search for the given independence test and background knowledge.
	FasDci(Graph graph, IndependenceTest independenceTest)	Constructs a new FastAdjacencySearch for DCI.
	FasDci(Graph graph, IndependenceTest independenceTest, ResolveSepsets.Method method, List<Set<Node>> marginalVars, List<IndependenceTest> independenceTests, SepsetMapDci knownIndependencies, SepsetMapDci knownAssociations)	Constructs a new FastAdjacencySearch for DCI with independence test pooling to resolve inconsistencies.
	FasDeterministic(Graph graph, IndependenceTest test)	Constructs a new FastAdjacencySearch.
	FasStableConcurrentFdr(Graph externalGraph, IndependenceTest test)	Constructs a new FastAdjacencySearch.
	Fasts(Graph graph, IndependenceTest test)	Constructs a new FastAdjacencySearch.
	GraphScore(Graph dag)	Constructs the score using a covariance matrix.
	GraphWithParameters(Graph graph)
	GraphWithParameters(SemIm semIm, Graph trueCPDAG)
	GraphWithPValue(Graph graph, double pValue)
	HbmsBeam(Graph graph, CovarianceMatrix cov, Knowledge knowledge)
	HbmsBeam(Graph graph, DataSet data, Knowledge knowledge)
	HbsmsGes(Graph graph, DataSet data)
	Ida(DataSet dataSet, Graph pattern, List<Node> possibleCauses)
	IndTestDSep(Graph graph)
	IndTestDSep(Graph graph, boolean keepLatents)	Constructs a new independence test that returns d-separation facts for the given graph as independence results.
	Ling(Graph g, int samples)	When you don't have a Dataset, supply a Graph and the number of samples to draw and the algorithm will generate a DataSet.
	LingamPattern(Graph cpdag, DataSet dataSet)
	LingamPattern2(Graph cpdag, List<DataSet> dataSets)
	Lofs(Graph CPDAG, List<DataSet> dataSets, boolean strongR2, boolean meekDone, boolean meanCenterResiduals)
	Lofs2(Graph CPDAG, List<DataSet> dataSets)
	PcLocal(IndependenceTest independenceTest, Graph graph)
	PossibleDsepFci(Graph graph, IndependenceTest test)	Creates a new SepSet and assumes that none of the variables have yet been checked.
	ScoredGraph(Graph graph, Double score)
	SepsetsConservative(Graph graph, IndependenceTest independenceTest, SepsetMap extraSepsets, int depth)
	SepsetsGreedy(Graph graph, IndependenceTest independenceTest, SepsetMap extraSepsets, int depth)
	SepsetsGreedy2(Graph graph, IndependenceTest independenceTest, TeyssierScorer scorer, SepsetMap extraSepsets, int depth)
	SepsetsPossibleDsep(Graph graph, IndependenceTest test, Knowledge knowledge, int depth, int maxPathLength)
	TsDagToPag(Graph dag)	Constructs a new FCI search for the given independence test and background knowledge.
	VarResult(DataSet dataSet, Graph collapsedVarGraph)

Constructor parameters in edu.cmu.tetrad.search with type arguments of type Graph

Modifier	Constructor	Description
	Ion(List<Graph> pags)	Constructs a new instance of the ION search from the input PAGs
	Ion2(List<Graph> pags)	Constructs a new instance of the ION search from the input PAGs

Uses of Graph in edu.cmu.tetrad.search.mb

Methods in edu.cmu.tetrad.search.mb that return Graph

Modifier and Type	Method	Description
Graph	Mmhc.search()	Runs PC starting with a fully connected graph over all of the variables in the domain of the independence test.

Uses of Graph in edu.cmu.tetrad.sem

Methods in edu.cmu.tetrad.sem that return Graph

Modifier and Type	Method	Description
Graph	LargeScaleSimulation.getGraph()
Graph	SemUpdater.getManipulatedGraph()

Methods in edu.cmu.tetrad.sem with parameters of type Graph

Modifier and Type	Method	Description
List<List<Node>>	Ricf.cliques(Graph graph)
Knowledge	LargeScaleSimulation.getKnowledge(Graph graph)
static List<Node>	ReidentifyVariables.getLatents(Graph graph)
static List<String>	ReidentifyVariables.reidentifyVariables1(List<List<Node>> partition, Graph trueGraph)
static List<String>	ReidentifyVariables.reidentifyVariables2(List<List<Node>> clusters, Graph trueGraph, DataSet data)
Ricf.RicfResult	Ricf.ricf2(Graph mag, ICovarianceMatrix covMatrix, double tolerance)	same as above but takes a Graph instead of a SemGraph
double	DagScorer.score(Graph dag)	Runs the estimator on the data and SemPm passed in through the constructor.
double	Scorer.score(Graph dag)

Constructors in edu.cmu.tetrad.sem with parameters of type Graph

Modifier	Constructor	Description
	GeneralizedSemPm(Graph graph)	Constructs a BayesPm from the given Graph, which must be convertible first into a ProtoSemGraph and then into a SemGraph.
	LargeScaleSimulation(Graph graph)
	LargeScaleSimulation(Graph graph, List<Node> nodes, int[] tierIndices)
	SemPm(Graph graph)	Constructs a BayesPm from the given Graph, which must be convertible first into a ProtoSemGraph and then into a SemGraph.

Uses of Graph in edu.cmu.tetrad.simulation

Methods in edu.cmu.tetrad.simulation that return Graph

Modifier and Type	Method	Description
static Graph	HsimUtils.evalEdges(Graph inputgraph, Set<Node> simnodes, Set<Node> realnodes)
static Graph	HsimUtils.mkRandSEMDAG(int numVars, int numEdges)

Methods in edu.cmu.tetrad.simulation with parameters of type Graph

Modifier and Type	Method	Description
List<Double>	Gdistance.distances(Graph graph1, Graph graph2)
static double[]	HsimUtils.errorEval(Graph estCPDAG, Graph truePattern)
static Graph	HsimUtils.evalEdges(Graph inputgraph, Set<Node> simnodes, Set<Node> realnodes)
static Set<Node>	HsimUtils.getAllParents(Graph inputgraph, Set<Node> inputnodes)

Uses of Graph in edu.cmu.tetrad.util

Methods in edu.cmu.tetrad.util that return Graph

Modifier and Type	Method	Description
static Graph	GraphSampling.createDisplayGraph(Graph graph, ResamplingEdgeEnsemble ensemble)	Create a graph for displaying and print out.
static Graph	GraphSampling.createGraphWithHighProbabilityEdges(List<Graph> graphs)	Combine all the edges from the list of graphs onto one graph with the edge type that has the highest frequency probability.
static Graph	GraphSampling.createGraphWithHighProbabilityEdges(List<Graph> graphs, ResamplingEdgeEnsemble ensemble)
static Graph	GraphSampling.createGraphWithoutNullEdges(Graph graph)	Create a graph from the given graph that contains no null edges.
static Graph	JsonUtils.parseJSONObjectToTetradGraph(String jsonResponse)
static Graph	JsonUtils.parseJSONObjectToTetradGraph(org.json.JSONObject jObj)

Methods in edu.cmu.tetrad.util with parameters of type Graph

Modifier and Type	Method	Description
static Graph	GraphSampling.createDisplayGraph(Graph graph, ResamplingEdgeEnsemble ensemble)	Create a graph for displaying and print out.
static Graph	GraphSampling.createGraphWithoutNullEdges(Graph graph)	Create a graph from the given graph that contains no null edges.
static Set<Edge>	JsonUtils.parseJSONArrayToTetradEdges(Graph graph, org.json.JSONArray jArray)
static Edge	JsonUtils.parseJSONObjectToTetradEdge(Graph graph, org.json.JSONObject jObj)

Method parameters in edu.cmu.tetrad.util with type arguments of type Graph

Modifier and Type	Method	Description
static Graph	GraphSampling.createGraphWithHighProbabilityEdges(List<Graph> graphs)	Combine all the edges from the list of graphs onto one graph with the edge type that has the highest frequency probability.
static Graph	GraphSampling.createGraphWithHighProbabilityEdges(List<Graph> graphs, ResamplingEdgeEnsemble ensemble)
static Set<edu.cmu.tetrad.util.GraphSampling.NodePair>	GraphSampling.getEdgeNodePairs(List<Graph> graphs)

Uses of Graph in edu.pitt.csb.mgm

Methods in edu.pitt.csb.mgm that return Graph

Modifier and Type	Method	Description
Graph	Mgm.graphFromMGM()	Converts MGM object to Graph object with edges if edge parameters are non-zero.
static Graph	MixedUtils.makeMixedGraph(Graph g, Map<String,Integer> m)
Graph	Mgm.search()	Simple search command for GraphSearch implementation.

Methods in edu.pitt.csb.mgm with parameters of type Graph

Modifier and Type	Method	Description
static int[][]	MixedUtils.allEdgeStats(Graph pT, Graph pE)
static int[][]	MixedUtils.allEdgeStats(Graph pT, Graph pE, HashMap<String,String> nodeDists)
static GeneralizedSemPm	MixedUtils.GaussianCategoricalPm(Graph trueGraph, String paramTemplate)
static GeneralizedSemPm	MixedUtils.GaussianTrinaryPm(Graph trueGraph, HashMap<String,String> nodeDists, int maxSample, String paramTemplate)
static Map<String,Integer>	MixedUtils.getNodeDists(Graph g)
static cern.colt.matrix.DoubleMatrix2D	MixedUtils.graphToMatrix(Graph graph)
static cern.colt.matrix.DoubleMatrix2D	MixedUtils.graphToMatrix(Graph graph, double undirectedWeight, double directedWeight)
static Graph	MixedUtils.makeMixedGraph(Graph g, Map<String,Integer> m)
static cern.colt.matrix.DoubleMatrix2D	MixedUtils.skeletonToMatrix(Graph graph)

Uses of Graph in edu.pitt.csb.stability

Methods in edu.pitt.csb.stability that return Graph

Modifier and Type	Method	Description
abstract Graph	DataGraphSearch.search(DataSet data)
Graph	SearchWrappers.FgesWrapper.search(DataSet ds)
Graph	SearchWrappers.MGMWrapper.search(DataSet ds)
Graph	SearchWrappers.PcStableWrapper.search(DataSet ds)

Uses of Graph in edu.pitt.dbmi.algo.bayesian.constraint.search

Methods in edu.pitt.dbmi.algo.bayesian.constraint.search that return Graph

Modifier and Type	Method	Description
Graph	RfciBsc.getGraphRBD()
Graph	RfciBsc.getGraphRBI()
Graph	PagSamplingRfci.search()
Graph	RfciBsc.search()

Uses of Graph in edu.pitt.dbmi.algo.resampling

Methods in edu.pitt.dbmi.algo.resampling that return Graph

Modifier and Type	Method	Description
Graph	GeneralResamplingTest.search()

Methods in edu.pitt.dbmi.algo.resampling that return types with arguments of type Graph

Modifier and Type	Method	Description
List<Graph>	GeneralResamplingTest.getGraphs()	Returns the individual bootstrap result graphs.
List<Graph>	GeneralResamplingSearch.search()

Methods in edu.pitt.dbmi.algo.resampling with parameters of type Graph

Modifier and Type	Method	Description
static int[][]	GeneralResamplingTest.getAdjConfusionMatrix(Graph truth, Graph estimate)
static int[][]	GeneralResamplingTest.getEdgeTypeConfusionMatrix(Graph truth, Graph estimate)
void	GeneralResamplingSearch.setExternalGraph(Graph externalGraph)
void	GeneralResamplingTest.setExternalGraph(Graph externalGraph)	Sets the initial graph.

Uses of Graph in edu.pitt.dbmi.algo.resampling.task

Methods in edu.pitt.dbmi.algo.resampling.task that return Graph

Modifier and Type	Method	Description
Graph	GeneralResamplingSearchRunnable.call()
Graph	GeneralResamplingSearchRunnable.getExternalGraph()

Methods in edu.pitt.dbmi.algo.resampling.task with parameters of type Graph

Modifier and Type	Method	Description
void	GeneralResamplingSearchRunnable.setExternalGraph(Graph externalGraph)