edu.ucla.belief.tree
Class EliminationTree

Object
  extended by EliminationTree

public class EliminationTree
extends Object


Field Summary
static int ADDITION
           
static int MULTIPLICATION
           
static int VALUE
           
 
Constructor Summary
EliminationTree(DirectedGraph tree, TableIndex[] inds, int[] type)
          Creates an Elimination Tree.
 
Method Summary
 int[] children(int node)
           
 TableIndex index(int node)
           
 int parent(int node)
           
 int size()
           
 int type(int node)
           
 
Methods inherited from class Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

MULTIPLICATION

public static final int MULTIPLICATION
See Also:
Constant Field Values

ADDITION

public static final int ADDITION
See Also:
Constant Field Values

VALUE

public static final int VALUE
See Also:
Constant Field Values
Constructor Detail

EliminationTree

public EliminationTree(DirectedGraph tree,
                       TableIndex[] inds,
                       int[] type)
Creates an Elimination Tree.

Parameters:
tree - A tree whose nodes are integers, that are ordered in a topological ordering where all of the leaves appear as 0 to N-1 where N is the number of leaves.
inds - A TableIndex for each of the nodes.
type - An integer describing the type of operation(One of ADDITION, MULTIPLICATION, or VALUE).
Method Detail

parent

public int parent(int node)
Returns:
-1 if parent is the root, the parent of node otherwise.

children

public int[] children(int node)

index

public TableIndex index(int node)

type

public int type(int node)

size

public int size()


Copyright 2010 UCLA Automated Reasoning Group