Package net.automatalib.graph

Interface AcceptanceGraph<N,E>

Type Parameters:

N - node class

E - edge class

All Superinterfaces:

FiniteRepresentation, Graph<N,E>, IndefiniteGraph<N,E>, IndefiniteSimpleGraph<N>, Iterable<N>, NodeAcceptance<N>, SimpleGraph<N>

public interface AcceptanceGraph<N,E>
extends Graph<N,E>, NodeAcceptance<N>

Interface for finite graphs that embody the concept of node acceptance.

Nested Class Summary

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

Graph.IntAbstraction<E>

Method Summary

Methods inherited from interface net.automatalib.graph.Graph

getAdjacentNodes, getOutgoingEdges, getOutgoingEdgesIterator, getVisualizationHelper

Methods inherited from interface net.automatalib.graph.IndefiniteGraph

getAdjacentNodesIterator, getEdgesBetween, getTarget

Methods inherited from interface net.automatalib.graph.IndefiniteSimpleGraph

createDynamicNodeMapping, createStaticNodeMapping, isConnected

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Methods inherited from interface net.automatalib.graph.concept.NodeAcceptance

isAcceptingNode

Methods inherited from interface net.automatalib.graph.SimpleGraph

getNodes, iterator, nodeIDs, size