SimpleGraph (AutomataLib 0.11.0 API)

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, AbstractCompactBidiGraph, AbstractCompactGraph, AbstractRecursiveADSLeafNode, AbstractRecursiveADSSymbolNode, ADSLeafNode, ADSSymbolNode, AutomatonGraphView, CFMPSGraphView, CompactBidiGraph, CompactGraph, CompactPMPG, CompactSimpleBidiGraph, CompactSimpleGraph, FiniteStateAcceptor.FSAGraphView, MealyMachine.MealyGraphView, ModalTransitionSystem.MTSGraphView, MooreMachine.MooreGraphView, ProceduralGraphView, SEVPAGraphView, SimpleMapGraph, SubsequentialTransducer.SSTGraphView, UniversalAutomatonGraphView, WitnessTree
```
public interface SimpleGraph<N>
extends IndefiniteSimpleGraph<N>, FiniteRepresentation
```
The finite version of a IndefiniteSimpleGraph.

Nested Class Summary

Nested Classes
Modifier and Type Interface Description

static interface SimpleGraph.IntAbstraction
Basic interface for integer abstractions of graphs.

Method Summary

All Methods Instance Methods Abstract Methods Default Methods
Modifier and Type	Method	Description
`Collection<N>`	`getNodes()`	Retrieves an (unmodifiable) collection of the nodes in this graph.
`default VisualizationHelper<N,?>`	`getVisualizationHelper()`	Returns the `VisualizationHelper` that contains information for displaying this graph.
`default Iterator<N>`	`iterator()`
`default NodeIDs<N>`	`nodeIDs()`
`default int`	`size()`	Retrieves the size (number of nodes) of this graph.

Methods inherited from interface net.automatalib.graph.IndefiniteSimpleGraph
createDynamicNodeMapping, createStaticNodeMapping, getAdjacentNodesIterator, isConnected

Methods inherited from interface java.lang.Iterable
forEach, spliterator

- Method Detail
  - getNodes
```
Collection<N> getNodes()
```
    Retrieves an (unmodifiable) collection of the nodes in this graph.
    
    Returns:
    
    the nodes in this graph
  - nodeIDs
```
default NodeIDs<N> nodeIDs()
```
  - getVisualizationHelper
```
default VisualizationHelper<N,?> getVisualizationHelper()
```
    Returns the VisualizationHelper that contains information for displaying this graph.
    
    Returns:
    
    the visualization helper
  - iterator
```
default Iterator<N> iterator()
```
    Specified by:
    
    iterator in interface Iterable<N>
  - size
```
default int size()
```
    Retrieves the size (number of nodes) of this graph.
    
    Specified by:
    
    size in interface FiniteRepresentation
    
    Returns:
    
    the number of nodes of this graph