S - (hypothesis) state typeI - input alphabet typeO - output alphabet typepublic class ADSLeafNode<S,I,O> extends AbstractRecursiveADSLeafNode<S,I,O,ADSNode<S,I,O>> implements ADSNode<S,I,O>
SimpleGraph.NormalGraphView<N,G extends SimpleGraph<N>>| Constructor and Description |
|---|
ADSLeafNode(ADSNode<S,I,O> parent,
S hypothesisState) |
getChildren, getHypothesisState, getParent, getSymbol, isLeaf, setHypothesisState, setParent, setSymbol, toStringclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitgetChildren, getHypothesisState, getNodesForRoot, getOutgoingEdges, getParent, getSymbol, getTarget, getVisualizationHelper, isLeaf, setHypothesisState, setParent, setSymbolasNormalGraphadjacentTargetsIterator, adjacentTargetsStream, getAdjacentTargets, getEdgesBetween, outgoingEdges, outgoingEdgesIterator, outgoingEdgesStreamiterator, nodeIDs, nodesStream, sizeadjacentTargets, createDynamicNodeMapping, createStaticNodeMapping, isConnectedforEach, spliteratorCopyright © 2018. All rights reserved.