Package net.automatalib.graph

Interface IndefiniteSimpleGraph<N>

Type Parameters:

N - node type

All Superinterfaces:

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>, IndefiniteGraph<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>, SimpleGraph<N>, UndirectedGraph<N,E>, UniversalBidirectionalGraph<N,E,NP,EP>, UniversalGraph<N,E,NP,EP>, UniversalIndefiniteGraph<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 IndefiniteSimpleGraph<N>
extends Iterable<N>

A simplified interface for indefinite graphs, exposing only adjacency information, but no further information about edge objects.

Method Summary

Modifier and Type	Method	Description
default <@Nullable V> MutableMapping<N,V>	createDynamicNodeMapping()	Creates a MutableMapping allowing to associate arbitrary data with this graph's nodes.
default <@Nullable V> MutableMapping<N,V>	createStaticNodeMapping()	Creates a MutableMapping allowing to associate arbitrary data with this graph's nodes.
Iterator<N>	getAdjacentNodesIterator(N node)	Retrieves, for a given node, all adjacent nodes.
default boolean	isConnected(N source, N target)	Checks, for two given nodes, whether they are connected.

Methods inherited from interface java.lang.Iterable

forEach, iterator, spliterator

Method Detail

getAdjacentNodesIterator

Iterator<N> getAdjacentNodesIterator(N node)

Retrieves, for a given node, all adjacent nodes.

Parameters:

node - the node

Returns:

an iterator over the adjacent nodes

isConnected

default boolean isConnected(N source,
                            N target)

Checks, for two given nodes, whether they are connected.

Parameters:

source - the source node

target - the target node

Returns:

true if the nodes are connect, false otherwise

createStaticNodeMapping

default <@Nullable V> MutableMapping<N,V> createStaticNodeMapping()

Creates a MutableMapping allowing 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.

Type Parameters:

V - the value type of the mapping

Returns:

the mutable mapping

createDynamicNodeMapping

default <@Nullable V> MutableMapping<N,V> createDynamicNodeMapping()

Creates a MutableMapping allowing to associate arbitrary data with this graph's nodes. The returned mapping maintains the association even when the transition system is modified.

Type Parameters:

V - the value type of the mapping

Returns:

the mutable mapping