IndefiniteGraph (AutomataLib :: API 0.11.0 API)

Type Parameters:

N - node type

E - edge type

All Superinterfaces:

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>, UniversalIndefiniteGraph<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 IndefiniteGraph<N,E>
extends IndefiniteSimpleGraph<N>
```
Interface for an (indefinite) graph structure. A graph consists of nodes, each of which has outgoing edges connecting to other nodes. In an indefinite graph, the node set is not required to be finite.

Method Summary

All Methods Instance Methods Abstract Methods Default Methods
Modifier and Type	Method	Description
`default Iterator<N>`	`getAdjacentNodesIterator(N node)`	Retrieves, for a given node, all adjacent nodes.
`default Iterator<E>`	`getEdgesBetween(N from, N to)`	Returns, for two given nodes, the edges between those nodes.
`Iterator<E>`	`getOutgoingEdgesIterator(N node)`	Retrieves, for a given node, all outgoing edges.
`N`	`getTarget(E edge)`	Retrieves, for a given edge, its target node.

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

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

- Method Detail
  - getOutgoingEdgesIterator
```
Iterator<E> getOutgoingEdgesIterator(N node)
```
    Retrieves, for a given node, all outgoing edges.
    
    Parameters:
    
    node - the node
    
    Returns:
    
    an iterator over the outgoing edges
  - getTarget
```
N getTarget(E edge)
```
    Retrieves, for a given edge, its target node.
    
    Parameters:
    
    edge - the edge.
    
    Returns:
    
    the target node of the given edge.
  - getEdgesBetween
```
default Iterator<E> getEdgesBetween(N from,
                                    N to)
```
    Returns, for two given nodes, the edges between those nodes.
    
    Parameters:
    
    from - the source node
    
    to - the target node
    
    Returns:
    
    an iterator over the edges between the two nodes
  - getAdjacentNodesIterator
```
default Iterator<N> getAdjacentNodesIterator(N node)
```
    Description copied from interface: IndefiniteSimpleGraph
    
    Retrieves, for a given node, all adjacent nodes.
    
    Specified by:
    
    getAdjacentNodesIterator in interface IndefiniteSimpleGraph<N>
    
    Parameters:
    
    node - the node
    
    Returns:
    
    an iterator over the adjacent nodes