il2.inf.structure
Class DGraph
Object
JoinTree
DGraph
public class DGraph
- extends JoinTree
A binary jointree basically. When the tree is
Constructor Summary |
DGraph(Graph tree,
Map clusterLabels)
Creates a DGraph from the supplied tree and cluster labels. |
Methods inherited from class JoinTree |
children, cluster, cluster, clusters, isLeaf, largestClusterSize, largestSeparatorSize, leafNeighbor, parents, relabelNodes, separator, separator, separators, smallestClusterContaining, tree |
STR_PREFIX_ROOT
public static final String STR_PREFIX_ROOT
- See Also:
- Constant Field Values
STR_PREFIX_INTERNAL
public static final String STR_PREFIX_INTERNAL
- See Also:
- Constant Field Values
STR_PREFIX_LEAF
public static final String STR_PREFIX_LEAF
- See Also:
- Constant Field Values
STR_CACHE_FALSE
public static final String STR_CACHE_FALSE
- See Also:
- Constant Field Values
STR_CACHE_TRUE
public static final String STR_CACHE_TRUE
- See Also:
- Constant Field Values
STR_TYPE_EVIDENCE_INDICATOR
public static final String STR_TYPE_EVIDENCE_INDICATOR
- See Also:
- Constant Field Values
STR_TYPE_CPT
public static final String STR_TYPE_CPT
- See Also:
- Constant Field Values
DGraph
public DGraph(Graph tree,
Map clusterLabels)
- Creates a DGraph from the supplied tree and cluster labels.
Note that the node labeling contract is stricter for DGraphs than for
JoinTrees. The leaf nodes need to be 0..(# of leaves)-1.
write
public void write(PrintWriter out,
Set cachedNodes,
Converter verter)
- Since:
- 120103
largestCutsetSize
public BigInteger largestCutsetSize()
largestContextSize
public BigInteger largestContextSize()
height
public int height()
diameter
public int diameter()
cutset
public Index cutset(Pair p)
context
public Index context(Pair p)
root
public UPair root()
Copyright 2010 UCLA Automated Reasoning Group