S
- (hypothesis) state typeI
- input alphabet typeO
- output alphabet type@ParametersAreNonnullByDefault public class ADTLeafNode<S,I,O> extends net.automatalib.graphs.ads.impl.AbstractRecursiveADSLeafNode<S,I,O,ADTNode<S,I,O>> implements ADTNode<S,I,O>
ADTNode.NodeType
Constructor and Description |
---|
ADTLeafNode(ADTNode<S,I,O> parent,
S hypothesisState) |
Modifier and Type | Method and Description |
---|---|
ADTNode.NodeType |
getNodeType()
Returns the node type of the current node.
|
ADTNode<S,I,O> |
sift(SymbolQueryOracle<I,O> oracle,
net.automatalib.words.Word<I> prefix)
Utility method, that sifts a given word through
this ADTNode. |
getChildren, getHypothesisState, getParent, getSymbol, isLeaf, setHypothesisState, setParent, setSymbol, toString
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
getNodes, getVisualizationHelper, isLeaf
getChildren, getHypothesisState, getNodesForRoot, getOutgoingEdges, getParent, getSymbol, getTarget, setHypothesisState, setParent, setSymbol
adjacentTargetsIterator, adjacentTargetsStream, getAdjacentTargets, getEdgesBetween, outgoingEdges, outgoingEdgesIterator, outgoingEdgesStream
iterator, nodeIDs, nodesStream, size
adjacentTargets, createDynamicNodeMapping, createStaticNodeMapping, isConnected
forEach, spliterator
public ADTNode<S,I,O> sift(SymbolQueryOracle<I,O> oracle, net.automatalib.words.Word<I> prefix)
ADTNode
this
ADTNode. If this
node is a public ADTNode.NodeType getNodeType()
ADTNode
getNodeType
in interface ADTNode<S,I,O>
Copyright © 2018. All rights reserved.