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() |
S |
getHypothesisState() |
N |
getParent() |
I |
getSymbol() |
boolean |
isLeaf() |
void |
setHypothesisState(S state) |
void |
setParent(N parent) |
void |
setSymbol(I symbol) |
String |
toString() |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitgetNodesForRoot, getOutgoingEdges, getTarget, getVisualizationHelperasNormalGraphadjacentTargetsIterator, adjacentTargetsStream, getAdjacentTargets, getEdgesBetween, outgoingEdges, outgoingEdgesIterator, outgoingEdgesStreamgetNodes, iterator, nodeIDs, nodesStream, sizeadjacentTargets, createDynamicNodeMapping, createStaticNodeMapping, isConnectedforEach, spliteratorpublic I getSymbol()
public void setSymbol(I symbol)
public N getParent()
public void setParent(N parent)
public Map<O,N> getChildren()
getChildren in interface RecursiveADSNode<S,I,O,N extends RecursiveADSNode<S,I,O,N>>public boolean isLeaf()
public S getHypothesisState()
getHypothesisState in interface RecursiveADSNode<S,I,O,N extends RecursiveADSNode<S,I,O,N>>public void setHypothesisState(S state)
setHypothesisState in interface RecursiveADSNode<S,I,O,N extends RecursiveADSNode<S,I,O,N>>Copyright © 2020. All rights reserved.