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, toStringclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitgetNodes, getVisualizationHelper, isLeafgetChildren, getHypothesisState, getNodesForRoot, getOutgoingEdges, getParent, getSymbol, getTarget, setHypothesisState, setParent, setSymboladjacentTargetsIterator, adjacentTargetsStream, getAdjacentTargets, getEdgesBetween, outgoingEdges, outgoingEdgesIterator, outgoingEdgesStreamiterator, nodeIDs, nodesStream, sizeadjacentTargets, createDynamicNodeMapping, createStaticNodeMapping, isConnectedforEach, spliteratorpublic ADTNode<S,I,O> sift(SymbolQueryOracle<I,O> oracle, net.automatalib.words.Word<I> prefix)
ADTNodethis ADTNode. If this node is a public ADTNode.NodeType getNodeType()
ADTNodegetNodeType in interface ADTNode<S,I,O>Copyright © 2018. All rights reserved.