- Type Parameters:
I
- input symbol type
O
- output symbol type
D
- node data type
- All Implemented Interfaces:
- Serializable, Iterable<AbstractWordBasedDTNode<I,O,D>>, net.automatalib.graphs.Graph<AbstractWordBasedDTNode<I,O,D>,Map.Entry<O,AbstractWordBasedDTNode<I,O,D>>>, net.automatalib.graphs.IndefiniteGraph<AbstractWordBasedDTNode<I,O,D>,Map.Entry<O,AbstractWordBasedDTNode<I,O,D>>>, net.automatalib.graphs.IndefiniteSimpleGraph<AbstractWordBasedDTNode<I,O,D>>, net.automatalib.graphs.SimpleGraph<AbstractWordBasedDTNode<I,O,D>>
- Direct Known Subclasses:
- BinaryDTree, MultiDTree
public abstract class AbstractWordBasedDiscriminationTree<I,O,D>
extends AbstractDiscriminationTree<net.automatalib.words.Word<I>,I,O,D,AbstractWordBasedDTNode<I,O,D>>
Convenient class for word-based discrimination trees that already binds certain generics.
- Author:
- frohme
- See Also:
- Serialized Form