Class Fas
java.lang.Object
edu.cmu.tetrad.algcomparison.algorithm.AbstractBootstrapAlgorithm
edu.cmu.tetrad.algcomparison.algorithm.oracle.cpdag.Fas
- All Implemented Interfaces:
Algorithm,LatentStructureAlgorithm,ReturnsBootstrapGraphs,TakesCovarianceMatrix,HasKnowledge,HasParameters,TakesIndependenceWrapper,TetradSerializable,Serializable
@Algorithm(name="FAS",
command="fas",
algoType=produce_undirected_graphs)
@Bootstrapping
public class Fas
extends AbstractBootstrapAlgorithm
implements Algorithm, HasKnowledge, TakesIndependenceWrapper, ReturnsBootstrapGraphs, TakesCovarianceMatrix, LatentStructureAlgorithm
Fast Adjacency Search (FAS)--i.e., the PC adjacency step, which is used in many algorithms.
- Version:
- $Id: $Id
- Author:
- josephramsey
- See Also:
-
Constructor Summary
ConstructorsConstructorDescriptionFas()Constructor for Fas.Fas(IndependenceWrapper test) Constructor for Fas. -
Method Summary
Modifier and TypeMethodDescriptiongetComparisonGraph(Graph graph) Returns that graph that the result should be compared to.Returns the data type that the search requires, whether continuous, discrete, or mixed.Returns a short, one-line description of this algorithm.Returns the independence wrapper.Returns a knowledge object.Returns the list of parameter names that are used.voidSets the independence wrapper.voidsetKnowledge(Knowledge knowledge) Sets a knowledge object.Methods inherited from class edu.cmu.tetrad.algcomparison.algorithm.AbstractBootstrapAlgorithm
getBootstrapGraphs, searchMethods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitMethods inherited from interface edu.cmu.tetrad.algcomparison.algorithm.ReturnsBootstrapGraphs
getBootstrapGraphs
-
Constructor Details
-
Fas
public Fas()Constructor for Fas.
-
Fas
Constructor for Fas.
- Parameters:
test- aIndependenceWrapperobject
-
-
Method Details
-
getComparisonGraph
Returns that graph that the result should be compared to.- Specified by:
getComparisonGraphin interfaceAlgorithm- Parameters:
graph- The true directed graph, if there is one.- Returns:
- The comparison graph.
-
getDescription
Returns a short, one-line description of this algorithm. This will be printed in the report.- Specified by:
getDescriptionin interfaceAlgorithm- Returns:
- This description.
-
getDataType
Returns the data type that the search requires, whether continuous, discrete, or mixed.- Specified by:
getDataTypein interfaceAlgorithm- Returns:
- This type.
-
getParameters
Returns the list of parameter names that are used. These are looked up in ParamMap, so if they're not- Specified by:
getParametersin interfaceHasParameters- Returns:
- Returns the list of parameter names that are used. These are looked up in ParamMap, so if they're not already defined they'll need to be defined there.
-
getKnowledge
Returns a knowledge object.- Specified by:
getKnowledgein interfaceHasKnowledge- Returns:
- a knowledge object.
-
setKnowledge
Sets a knowledge object.- Specified by:
setKnowledgein interfaceHasKnowledge- Parameters:
knowledge- a knowledge object.
-
getIndependenceWrapper
Returns the independence wrapper.- Specified by:
getIndependenceWrapperin interfaceTakesIndependenceWrapper- Returns:
- the independence wrapper.
-
setIndependenceWrapper
Sets the independence wrapper.- Specified by:
setIndependenceWrapperin interfaceTakesIndependenceWrapper- Parameters:
test- the independence wrapper.
-