Module de.learnlib.algorithm.adt
Package de.learnlib.algorithm.adt.adt

Interface ADTNode<S,​I,​O>

  • Type Parameters:
    S - (hypothesis) state type
    I - input alphabet type
    O - output alphabet type
    All Superinterfaces:
    net.automatalib.automaton.concept.FiniteRepresentation, net.automatalib.graph.Graph<ADTNode<S,​I,​O>,​ADTNode<S,​I,​O>>, net.automatalib.graph.IndefiniteGraph<ADTNode<S,​I,​O>,​ADTNode<S,​I,​O>>, net.automatalib.graph.IndefiniteSimpleGraph<ADTNode<S,​I,​O>>, Iterable<ADTNode<S,​I,​O>>, net.automatalib.graph.ads.RecursiveADSNode<S,​I,​O,​ADTNode<S,​I,​O>>, net.automatalib.graph.SimpleGraph<ADTNode<S,​I,​O>>
    All Known Implementing Classes:
    ADTLeafNode, ADTResetNode, ADTSymbolNode
    public interface ADTNode<S,​I,​O>
extends net.automatalib.graph.ads.RecursiveADSNode<S,​I,​O,​ADTNode<S,​I,​O>>
    The ADT equivalent of ADSNode. In contrast to regular adaptive distinguishing sequences, an ADT node may also represent a reset node that semantically separates multiple ADSs.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Interface Description
      static class  ADTNode.NodeType
      Utility enum to distinguish the 3 possible types of ADT nodes.

      • Nested classes/interfaces inherited from interface net.automatalib.graph.Graph

        net.automatalib.graph.Graph.IntAbstraction<E extends Object>

    • Method Summary

      All Methods Instance Methods Abstract Methods Default Methods 
      Modifier and Type Method Description
      default ADTNode<S,​I,​O> getChild​(O output)
      Convenience method for directly accessing this node's children.
      default Collection<ADTNode<S,​I,​O>> getNodes()  
      ADTNode.NodeType getNodeType()
      Returns the node type of the current node.
      default net.automatalib.visualization.VisualizationHelper<ADTNode<S,​I,​O>,​ADTNode<S,​I,​O>> getVisualizationHelper()  
      default boolean isLeaf()  

      • Methods inherited from interface net.automatalib.graph.Graph

        getAdjacentNodes, getOutgoingEdgesIterator

      • Methods inherited from interface net.automatalib.graph.IndefiniteGraph

        getAdjacentNodesIterator, getEdgesBetween

      • Methods inherited from interface net.automatalib.graph.IndefiniteSimpleGraph

        isConnected

      • Methods inherited from interface net.automatalib.graph.ads.RecursiveADSNode

        getChildren, getNodesForRoot, getOutgoingEdges, getParent, getState, getSymbol, getTarget, setParent, setState, setSymbol

      • Methods inherited from interface net.automatalib.graph.SimpleGraph

        createDynamicNodeMapping, createStaticNodeMapping, iterator, nodeIDs, size

    • Method Detail

      • getChild

        default ADTNode<S,​I,​O> getChild​(O output)
        Convenience method for directly accessing this node's children.
        Parameters:
        output - the output symbol to determine the child to returned
        Returns:
        the child node that is mapped to given output. May be null,

      • getNodes

        default Collection<ADTNode<S,​I,​O>> getNodes()
        Specified by:
        getNodes in interface net.automatalib.graph.SimpleGraph<S>

      • getVisualizationHelper

        default net.automatalib.visualization.VisualizationHelper<ADTNode<S,​I,​O>,​ADTNode<S,​I,​O>> getVisualizationHelper()
        Specified by:
        getVisualizationHelper in interface net.automatalib.graph.Graph<S,​I>
        Specified by:
        getVisualizationHelper in interface net.automatalib.graph.ads.RecursiveADSNode<S,​I,​O,​ADTNode<S,​I,​O>>
        Specified by:
        getVisualizationHelper in interface net.automatalib.graph.SimpleGraph<S>

      • isLeaf

        default boolean isLeaf()
        Specified by:
        isLeaf in interface net.automatalib.graph.ads.RecursiveADSNode<S,​I,​O,​ADTNode<S,​I,​O>>

      • getNodeType

        ADTNode.NodeType getNodeType()
        Returns the node type of the current node.
        Returns:
        the node type