- Type Parameters:
I - input symbol type
O - output symbol type
D - node data type
- All Implemented Interfaces:
- Serializable, Iterable<AbstractWordBasedDTNode<I,O,D>>, Graph<AbstractWordBasedDTNode<I,O,D>,Map.Entry<O,AbstractWordBasedDTNode<I,O,D>>>, IndefiniteGraph<AbstractWordBasedDTNode<I,O,D>,Map.Entry<O,AbstractWordBasedDTNode<I,O,D>>>, IndefiniteSimpleGraph<AbstractWordBasedDTNode<I,O,D>>, SimpleGraph<AbstractWordBasedDTNode<I,O,D>>
- Direct Known Subclasses:
- BinaryDTree, MultiDTree
public abstract class AbstractWordBasedDiscriminationTree<I,O,D>
extends AbstractDiscriminationTree<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