- Type Parameters:
N- node type
- All Superinterfaces:
FiniteRepresentation,IndefiniteSimpleGraph<N>,Iterable<N>
- All Known Subinterfaces:
AcceptanceGraph<N,,E> ADSNode<S,,I, O> BidirectionalGraph<N,,E> FiniteKripkeStructure<N,,E, AP> FiniteLabeledGraph<N,,E, L> Graph<N,,E> MutableGraph<N,,E, NP, EP> MutableProceduralModalProcessGraph<N,,L, E, AP, TP> MutableUniversalBidirectionalGraph<N,,E, NP, EP> ProceduralModalProcessGraph<N,,L, E, AP, TP> RecursiveADSNode<S,,I, O, N> ShrinkableGraph<N,,E> UndirectedGraph<N,,E> UniversalBidirectionalGraph<N,,E, NP, EP> UniversalGraph<N,E, NP, EP>
- All Known Implementing Classes:
AbstractAutomatonGraphView,AbstractBricsAutomaton.GraphView,AbstractCompactGraph,AbstractCompactUniversalBidiGraph,AbstractCompactUniversalGraph,AbstractRecursiveADSLeafNode,AbstractRecursiveADSSymbolNode,ADSLeafNode,ADSSymbolNode,AutomatonGraphView,CFMPSGraphView,CompactGraph,CompactPMPG,CompactSimpleBidiGraph,CompactSimpleGraph,CompactUniversalBidiGraph,CompactUniversalGraph,FiniteStateAcceptor.FSAGraphView,MealyMachine.MealyGraphView,MMLTGraphView,ModalTransitionSystem.MTSGraphView,MooreMachine.MooreGraphView,ProceduralGraphView,SEVPAGraphView,SimpleMapGraph,SubsequentialTransducer.SSTGraphView,UniversalAutomatonGraphView,WitnessTree
The finite version of a
IndefiniteSimpleGraph.-
Nested Class Summary
Nested ClassesModifier and TypeInterfaceDescriptionstatic interfaceBasic interface for integer abstractions of graphs. -
Method Summary
Modifier and TypeMethodDescriptiondefault <V> MutableMapping<N,V> Creates aMutableMappingallowing to associate arbitrary data with this graph's nodes.default <V> MutableMapping<N,V> Creates aMutableMappingallowing to associate arbitrary data with this graph's nodes.getNodes()Retrieves an (unmodifiable) collection of the nodes in this graph.default VisualizationHelper<N,?> Returns theVisualizationHelperthat contains information for displaying this graph.iterator()nodeIDs()default intsize()Retrieves the size (number of nodes) of this graph.Methods inherited from interface net.automatalib.graph.IndefiniteSimpleGraph
getAdjacentNodesIterator, isConnectedMethods inherited from interface java.lang.Iterable
forEach, spliterator
-
Method Details
-
getNodes
Collection<N> getNodes()Retrieves an (unmodifiable) collection of the nodes in this graph.- Returns:
- the nodes in this graph
-
nodeIDs
-
iterator
-
size
default int size()Retrieves the size (number of nodes) of this graph.- Specified by:
sizein interfaceFiniteRepresentation- Returns:
- the number of nodes of this graph
-
createStaticNodeMapping
Description copied from interface:IndefiniteSimpleGraphCreates aMutableMappingallowing to associate arbitrary data with this graph's nodes. The returned mapping is however only guaranteed to work correctly if the transition system is not modified.- Specified by:
createStaticNodeMappingin interfaceIndefiniteSimpleGraph<N>- Type Parameters:
V- the value type of the mapping- Returns:
- the mutable mapping
-
createDynamicNodeMapping
Description copied from interface:IndefiniteSimpleGraphCreates aMutableMappingallowing to associate arbitrary data with this graph's nodes. The returned mapping maintains the association even when the transition system is modified.- Specified by:
createDynamicNodeMappingin interfaceIndefiniteSimpleGraph<N>- Type Parameters:
V- the value type of the mapping- Returns:
- the mutable mapping
-
getVisualizationHelper
Returns theVisualizationHelperthat contains information for displaying this graph.- Returns:
- the visualization helper
-