Class SepsetMap
- All Implemented Interfaces:
- TetradSerializable,- Serializable
Stores a map from pairs of nodes to separating sets--that is, for each unordered pair of nodes {node1, node2} in a graph, stores a set of nodes conditional on which node1 and node2 are independent (where the nodes are considered as variables) or stores null if the pair was not judged to be independent. (Note that if a sepset is non-null and empty, that should means that the compared nodes were found to be independent conditional on the empty set, whereas if a sepset is null, that should mean that no set was found yet conditional on which the compared nodes are independent. So at the end of the search, a null sepset carries different information from an empty sepset.)> 0
We cast the variable-like objects to Node to allow them either to be variables explicitly or else to be graph nodes that in some model could be considered as variables. This allows us to use d-separation as a graphical indicator of what independendence in models ideally should be.> 0
- Author:
- Joseph Ramsey
- See Also:
- 
Constructor SummaryConstructors
- 
Method SummaryModifier and TypeMethodDescriptionvoidbooleanRetrieves the sepset previously set for {a, b}, or null if no such set was previously set.doublestatic SepsetMapGenerates a simple exemplar of this class to test serialization.voidSets the sepset for {x, y} to be z.voidset(Node x, LinkedHashSet<Node> z) intsize()toString()
- 
Constructor Details- 
SepsetMappublic SepsetMap()
- 
SepsetMap
 
- 
- 
Method Details- 
serializableInstanceGenerates a simple exemplar of this class to test serialization.
- 
setSets the sepset for {x, y} to be z. Note that {x, y} is unordered.
- 
getRetrieves the sepset previously set for {a, b}, or null if no such set was previously set.
- 
getPValue
- 
set
- 
get
- 
equals
- 
sizepublic int size()
- 
toString
- 
addAll
 
-