learner
Class DirectedAcyclicGraph

java.lang.Object
  learner.DirectedAcyclicGraph

public class DirectedAcyclicGraph
extends java.lang.Object

The Directed Acyclic Graph represents a set of trees as a pointer structure, and can thus avoid storing multiple copies of identical (sub)trees.

Constructor Summary

DirectedAcyclicGraph()

Method Summary

Tree	addState(Tree t)
Tree	addTransition(Tree t)
boolean	containsState(Tree t)
boolean	containsTransition(Tree t)
boolean	containsTransition2(Tree t)
java.util.LinkedHashSet<Tree>	getStates()
java.util.LinkedHashSet<Tree>	getTransitions()
Tree	representative(Tree t)
Tree	representativeState(Tree t)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

DirectedAcyclicGraph

public DirectedAcyclicGraph()

Method Detail

containsState

public boolean containsState(Tree t)

containsTransition

public boolean containsTransition(Tree t)

containsTransition2

public boolean containsTransition2(Tree t)

representativeState

public Tree representativeState(Tree t)

representative

public Tree representative(Tree t)

addState

public Tree addState(Tree t)

addTransition

public Tree addTransition(Tree t)

getStates

public java.util.LinkedHashSet<Tree> getStates()

getTransitions

public java.util.LinkedHashSet<Tree> getTransitions()