Graph (AutomataLib :: API 0.11.0 API)

Type Parameters:

N - node type

E - edge type

All Superinterfaces:

FiniteRepresentation, IndefiniteGraph<N,E>, IndefiniteSimpleGraph<N>, Iterable<N>, SimpleGraph<N>

All Known Subinterfaces:

AcceptanceGraph<N,E>, ADSNode<S,I,O>, BidirectionalGraph<N,E>, FiniteKripkeStructure<N,E,AP>, FiniteLabeledGraph<N,E,L>, 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, AutomatonGraphView, CFMPSGraphView, FiniteStateAcceptor.FSAGraphView, MealyMachine.MealyGraphView, ModalTransitionSystem.MTSGraphView, MooreMachine.MooreGraphView, ProceduralGraphView, SEVPAGraphView, SubsequentialTransducer.SSTGraphView, UniversalAutomatonGraphView
```
public interface Graph<N,E>
extends IndefiniteGraph<N,E>, SimpleGraph<N>
```
Graph interface. Like an IndefiniteGraph, but with the additional requirement that the set of nodes be finite.

Nested Class Summary

Nested Classes
Modifier and Type Interface Description

static interface Graph.IntAbstraction<E>
Interface for node integer abstractions of a Graph.

Method Summary

All Methods Instance Methods Abstract Methods Default Methods
Modifier and Type	Method	Description
`default Collection<N>`	`getAdjacentNodes(N node)`	Retrieves, for a given node, the (finite) collection of all adjacent nodes.
`Collection<E>`	`getOutgoingEdges(N node)`	Retrieves, for a given node, the (finite) collection of all outgoing edges.
`default Iterator<E>`	`getOutgoingEdgesIterator(N node)`	Retrieves, for a given node, all outgoing edges.
`default VisualizationHelper<N,E>`	`getVisualizationHelper()`	Returns the `VisualizationHelper` that contains information for displaying this graph.

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

- Method Detail
  - getOutgoingEdges
```
Collection<E> getOutgoingEdges(N node)
```
    Retrieves, for a given node, the (finite) collection of all outgoing edges.
    
    Parameters:
    
    node - the node
    
    Returns:
    
    a collection containing the outgoing edges
  - getAdjacentNodes
```
default Collection<N> getAdjacentNodes(N node)
```
    Retrieves, for a given node, the (finite) collection of all adjacent nodes.
    
    Parameters:
    
    node - the node
    
    Returns:
    
    a collection containing the outgoing edges
  - getOutgoingEdgesIterator
```
default Iterator<E> getOutgoingEdgesIterator(N node)
```
    Description copied from interface: IndefiniteGraph
    
    Retrieves, for a given node, all outgoing edges.
    
    Specified by:
    
    getOutgoingEdgesIterator in interface IndefiniteGraph<N,E>
    
    Parameters:
    
    node - the node
    
    Returns:
    
    an iterator over the outgoing edges
  - getVisualizationHelper
```
default VisualizationHelper<N,E> getVisualizationHelper()
```
    Description copied from interface: SimpleGraph
    
    Returns the VisualizationHelper that contains information for displaying this graph.
    
    Specified by:
    
    getVisualizationHelper in interface SimpleGraph<N>
    
    Returns:
    
    the visualization helper