Package net.automatalib.graph
Interface UniversalIndefiniteGraph<N,E,NP,EP>
-
- Type Parameters:
N- node classE- edge classNP- node property classEP- edge property class
- All Superinterfaces:
IndefiniteGraph<N,E>,IndefiniteSimpleGraph<N>,Iterable<N>
- 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>,UniversalGraph<N,E,NP,EP>
- All Known Implementing Classes:
FiniteStateAcceptor.FSAGraphView,MealyMachine.MealyGraphView,ModalTransitionSystem.MTSGraphView,MooreMachine.MooreGraphView,SubsequentialTransducer.SSTGraphView,UniversalAutomatonGraphView
public interface UniversalIndefiniteGraph<N,E,NP,EP> extends IndefiniteGraph<N,E>
A universal graph, i.e., with (possibly empty) node and edge properties. For a documentation on the concept of "universal", seeUniversalTransitionSystem.
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description EPgetEdgeProperty(E edge)Retrieves the property of a given edge.NPgetNodeProperty(N node)Retrieves the property of a given node.-
Methods inherited from interface net.automatalib.graph.IndefiniteGraph
getAdjacentNodesIterator, getEdgesBetween, getOutgoingEdgesIterator, getTarget
-
Methods inherited from interface net.automatalib.graph.IndefiniteSimpleGraph
createDynamicNodeMapping, createStaticNodeMapping, isConnected
-
Methods inherited from interface java.lang.Iterable
forEach, iterator, spliterator
-
-