net.automatalib.graphs

Interface IndefiniteGraph<N,E>

Type Parameters:

N - node type

E - edge type

All Superinterfaces:

IndefiniteSimpleGraph<N>

All Known Subinterfaces:

AcceptanceGraph<N,E>, ADSNode<S,I,O>, BidirectionalGraph<N,E>, FiniteKripkeStructure<N,E,AP>, FiniteKTS<N,E,AP,L>, FiniteLTS<N,E,L>, Graph<N,E>, IndefiniteLTS<N,E,L>, MutableGraph<N,E,NP,EP>, RecursiveADSNode<S,I,O,N>, ShrinkableGraph<N,E>, UndirectedGraph<N,E>, UniversalGraph<N,E,NP,EP>, UniversalIndefiniteGraph<N,E,NP,EP>

All Known Implementing Classes:

AbstractAutomatonGraphView, AutomatonGraphView, FiniteStateAcceptor.FSAGraphView, IndefiniteSimpleGraph.NormalGraphView, MealyMachine.MealyGraphView, SimpleGraph.NormalGraphView, UniversalAutomatonGraphView

@ParametersAreNonnullByDefault
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.

Author:

Malte Isberner

Nested Class Summary

Nested classes/interfaces inherited from interface net.automatalib.graphs.IndefiniteSimpleGraph

IndefiniteSimpleGraph.NormalGraphView<N,G extends IndefiniteSimpleGraph<N>>

Method Summary

Modifier and Type	Method and Description
default Iterator<N>	adjacentTargetsIterator(N node)
default Stream<N>	adjacentTargetsStream(N node)
default IndefiniteGraph<N,E>	asNormalGraph()
default Collection<N>	getAdjacentTargets(N node)
default Collection<E>	getEdgesBetween(N from, N to)
Collection<E>	getOutgoingEdges(N node) Retrieves the outgoing edges of a given node.
N	getTarget(E edge) Retrieves, for a given edge, its target node.
default Iterable<E>	outgoingEdges(N node)
default Iterator<E>	outgoingEdgesIterator(N node)
default Stream<E>	outgoingEdgesStream(N node)

Methods inherited from interface net.automatalib.graphs.IndefiniteSimpleGraph

adjacentTargets, createDynamicNodeMapping, createStaticNodeMapping, isConnected

Method Detail

adjacentTargetsIterator

default Iterator<N> adjacentTargetsIterator(N node)

Specified by:

adjacentTargetsIterator in interface IndefiniteSimpleGraph<N>

getAdjacentTargets

default Collection<N> getAdjacentTargets(N node)

Specified by:

getAdjacentTargets in interface IndefiniteSimpleGraph<N>

adjacentTargetsStream

default Stream<N> adjacentTargetsStream(N node)

Specified by:

adjacentTargetsStream in interface IndefiniteSimpleGraph<N>

asNormalGraph

default IndefiniteGraph<N,E> asNormalGraph()

Specified by:

asNormalGraph in interface IndefiniteSimpleGraph<N>

outgoingEdgesStream

@Nonnull
default Stream<E> outgoingEdgesStream(N node)

outgoingEdgesIterator

@Nonnull
default Iterator<E> outgoingEdgesIterator(N node)

getOutgoingEdges

@Nonnull
Collection<E> getOutgoingEdges(N node)

Retrieves the outgoing edges of a given node.

Parameters:

node - the node.

Returns:

a Collection of all outgoing edges, or null if the node has no outgoing edges.

outgoingEdges

@Nonnull
default Iterable<E> outgoingEdges(N node)

getEdgesBetween

@Nonnull
default Collection<E> getEdgesBetween(N from,
                                               N to)

getTarget

@Nonnull
N getTarget(E edge)

Retrieves, for a given edge, its target node.

Parameters:

edge - the edge.

Returns:

the target node of the given edge.