Package edu.cmu.tetrad.graph
Class IndependenceFact
java.lang.Object
edu.cmu.tetrad.graph.IndependenceFact
- All Implemented Interfaces:
TetradSerializable
,Serializable
,Comparable<IndependenceFact>
public final class IndependenceFact
extends Object
implements Comparable<IndependenceFact>, TetradSerializable
Stores a triple (x, y, z) of nodes. Note that (x, y, z) = (z, y, x). Useful for marking graphs.
- Author:
- josephramsey
- See Also:
-
Constructor Summary
ConstructorsConstructorDescriptionIndependenceFact
(Node x, Node y, Node... z) IndependenceFact
(Node x, Node y, Set<Node> z) -
Method Summary
Modifier and TypeMethodDescriptionint
compareTo
(IndependenceFact fact) Note that this compareTo method gives a lexical ordering for independence facts and doesn't reflect independence fact equality.boolean
getX()
getY()
getZ()
int
hashCode()
static IndependenceFact
Generates a simple exemplar of this class to test serialization.toString()
-
Constructor Details
-
IndependenceFact
-
IndependenceFact
-
-
Method Details
-
serializableInstance
Generates a simple exemplar of this class to test serialization. -
getX
-
getY
-
getZ
-
hashCode
public int hashCode() -
equals
-
toString
-
compareTo
Note that this compareTo method gives a lexical ordering for independence facts and doesn't reflect independence fact equality. So sorted sets should not be used to check for independence fact existence, for instance. -jdramsey.- Specified by:
compareTo
in interfaceComparable<IndependenceFact>
-