Package net.automatalib.graph

Interface UniversalGraph<N,E,NP,EP>

All Superinterfaces:

FiniteRepresentation, Graph<N,E>, IndefiniteGraph<N,E>, IndefiniteSimpleGraph<N>, Iterable<N>, SimpleGraph<N>, UniversalIndefiniteGraph<N,E,NP,EP>

All Known Subinterfaces:

MutableGraph<N,E,NP,EP>, MutableProceduralModalProcessGraph<N,L,E,AP,TP>, MutableUniversalBidirectionalGraph<N,E,NP,EP>, ProceduralModalProcessGraph<N,L,E,AP,TP>, UniversalBidirectionalGraph<N,E,NP,EP>

All Known Implementing Classes:

AbstractBricsAutomaton.GraphView, AbstractCompactBidiGraph, AbstractCompactGraph, CompactBidiGraph, CompactGraph, CompactPMPG, CompactSimpleBidiGraph, CompactSimpleGraph, FiniteStateAcceptor.FSAGraphView, MealyMachine.MealyGraphView, ModalTransitionSystem.MTSGraphView, MooreMachine.MooreGraphView, SimpleMapGraph, SubsequentialTransducer.SSTGraphView, UniversalAutomatonGraphView, WitnessTree

public interface UniversalGraph<N,E,NP,EP>
extends Graph<N,E>, UniversalIndefiniteGraph<N,E,NP,EP>

Nested Class Summary

Nested Classes

Modifier and Type	Interface	Description
static interface	UniversalGraph.IntAbstraction<E,NP,EP>	Interface for node integer abstractions of a UniversalGraph.

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.SimpleGraph

getNodes, iterator, nodeIDs, size

Methods inherited from interface net.automatalib.graph.UniversalIndefiniteGraph

getEdgeProperty, getNodeProperty