S
- (hypothesis) state typeI
- input alphabet typeO
- output alphabet typeN
- the concrete node typepublic abstract class AbstractRecursiveADSSymbolNode<S,I,O,N extends RecursiveADSNode<S,I,O,N>> extends Object implements RecursiveADSNode<S,I,O,N>, Serializable
SimpleGraph.NormalGraphView<N,G extends SimpleGraph<N>>
Constructor and Description |
---|
AbstractRecursiveADSSymbolNode(N parent,
I symbol) |
Modifier and Type | Method and Description |
---|---|
Map<O,N> |
getChildren()
Returns a mapping to the child nodes of
this ADS node. |
S |
getHypothesisState()
Returns the hypothesis state associated with this ADS node.
|
N |
getParent()
Returns the parent node of
this node. |
I |
getSymbol()
Returns the input symbol associated with this ADS node.
|
boolean |
isLeaf()
A utility method indicating whether
this node represents a leaf of an ADS (and therefore referencing a
hypothesis state) or an inner node (and therefore referencing an input symbol). |
void |
setHypothesisState(S state)
|
void |
setParent(N parent) |
void |
setSymbol(I symbol)
|
String |
toString() |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
getNodesForRoot, getOutgoingEdges, getTarget, getVisualizationHelper
asNormalGraph
adjacentTargetsIterator, adjacentTargetsStream, getAdjacentTargets, getEdgesBetween, outgoingEdges, outgoingEdgesIterator, outgoingEdgesStream
getNodes, iterator, nodeIDs, nodesStream, size
adjacentTargets, createDynamicNodeMapping, createStaticNodeMapping, isConnected
forEach, spliterator
public I getSymbol()
RecursiveADSNode
getSymbol
in interface RecursiveADSNode<S,I,O,N extends RecursiveADSNode<S,I,O,N>>
null
if this
is a leaf node (see RecursiveADSNode.isLeaf()
), the associated input symbol
otherwise.public void setSymbol(I symbol)
RecursiveADSNode
public N getParent()
RecursiveADSNode
this
node.public void setParent(N parent)
public Map<O,N> getChildren()
RecursiveADSNode
this
ADS node.getChildren
in interface RecursiveADSNode<S,I,O,N extends RecursiveADSNode<S,I,O,N>>
null
.public boolean isLeaf()
RecursiveADSNode
this
node represents a leaf of an ADS (and therefore referencing a
hypothesis state) or an inner node (and therefore referencing an input symbol).public S getHypothesisState()
RecursiveADSNode
getHypothesisState
in interface RecursiveADSNode<S,I,O,N extends RecursiveADSNode<S,I,O,N>>
null
if this
is an inner node (see RecursiveADSNode.isLeaf()
), the associated hypothesis state
otherwise.public void setHypothesisState(S state)
RecursiveADSNode
setHypothesisState
in interface RecursiveADSNode<S,I,O,N extends RecursiveADSNode<S,I,O,N>>
state
- the hypothesis state to be associated with this ADS node.Copyright © 2020. All rights reserved.