net.automatalib.graphs

Interface FiniteLTS<N,E,L>

Type Parameters:

N - node class

E - edge class

L - label class

All Superinterfaces:

EdgeLabels<E,L>, Graph<N,E>, IndefiniteGraph<N,E>, IndefiniteLTS<N,E,L>, IndefiniteSimpleGraph<N>, Iterable<N>, SimpleGraph<N>

All Known Subinterfaces:

FiniteKTS<N,E,AP,L>

public interface FiniteLTS<N,E,L>
extends Graph<N,E>, IndefiniteLTS<N,E,L>

A finite LTS is an IndefiniteLTS with a finite number of nodes.

Author:

Malte Isberner

Nested Class Summary

Nested classes/interfaces inherited from interface net.automatalib.graphs.SimpleGraph

SimpleGraph.NormalGraphView<N,G extends SimpleGraph<N>>

Method Summary

Methods inherited from interface net.automatalib.graphs.Graph

asNormalGraph, getVisualizationHelper

Methods inherited from interface net.automatalib.graphs.SimpleGraph

getNodes, iterator, nodeIDs, nodesStream, size

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Methods inherited from interface net.automatalib.graphs.IndefiniteGraph

adjacentTargetsIterator, adjacentTargetsStream, getAdjacentTargets, getEdgesBetween, getOutgoingEdges, getTarget, outgoingEdges, outgoingEdgesIterator, outgoingEdgesStream

Methods inherited from interface net.automatalib.graphs.IndefiniteSimpleGraph

adjacentTargets, createDynamicNodeMapping, createStaticNodeMapping, isConnected

Methods inherited from interface net.automatalib.graphs.concepts.EdgeLabels

getEdgeLabel