net.automatalib.graphs

Interface SimpleGraph<N>

Type Parameters:

N - node type

All Superinterfaces:

IndefiniteSimpleGraph<N>, Iterable<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>, IncrementalDFABuilder.GraphView<I,N,E>, IncrementalMealyBuilder.GraphView<I,O,N,E>, MutableGraph<N,E,NP,EP>, RecursiveADSNode<S,I,O,N>, ShrinkableGraph<N,E>, UndirectedGraph<N,E>, UniversalGraph<N,E,NP,EP>

All Known Implementing Classes:

AbstractAutomatonGraphView, AbstractBricsAutomaton.GraphView, AbstractCompactGraph, AbstractCompactNPGraph, AbstractCompactSimpleGraph, AbstractIncrementalDFABuilder.AbstractGraphView, AbstractIncrementalDFADAGBuilder.GraphView, AbstractIncrementalMealyBuilder.AbstractGraphView, AbstractIncrementalMealyTreeBuilder.GraphView, AbstractOneSEVPA, AbstractRecursiveADSLeafNode, AbstractRecursiveADSSymbolNode, ADSLeafNode, ADSSymbolNode, AutomatonGraphView, CompactGraph, CompactSimpleBidiGraph, CompactSimpleGraph, DefaultOneSEVPA, FiniteStateAcceptor.FSAGraphView, IncrementalDFATreeBuilder.GraphView, IncrementalMealyDAGBuilder.GraphView, MealyMachine.MealyGraphView, MooreMachine.MooreGraphView, ProductOneSEVPA, SharedSuffixTrie, SimpleGraph.NormalGraphView, SimpleMapGraph, SuffixTrie, UniversalAutomatonGraphView

public interface SimpleGraph<N>
extends IndefiniteSimpleGraph<N>, Iterable<N>

The finite version of a IndefiniteSimpleGraph.

Author:

Malte Isberner

Nested Class Summary

Nested Classes

Modifier and Type	Interface and Description
static class	SimpleGraph.NormalGraphView<N,G extends SimpleGraph<N>>

Method Summary

Modifier and Type	Method and Description
default Graph<N,?>	asNormalGraph()
Collection<N>	getNodes() Retrieves an (unmodifiable) collection of the nodes in this graph.
default VisualizationHelper<N,?>	getVisualizationHelper()
default Iterator<N>	iterator()
default NodeIDs<N>	nodeIDs()
default Stream<N>	nodesStream()
default int	size() Retrieves the number of nodes of this graph.

Methods inherited from interface net.automatalib.graphs.IndefiniteSimpleGraph

adjacentTargets, adjacentTargetsIterator, adjacentTargetsStream, createDynamicNodeMapping, createStaticNodeMapping, getAdjacentTargets, isConnected

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Method Detail

size

default int size()

Retrieves the number of nodes of this graph.

Returns:

the number of nodes of this graph.

getNodes

Collection<N> getNodes()

Retrieves an (unmodifiable) collection of the nodes in this graph.

Returns:

the nodes in this graph

iterator

default Iterator<N> iterator()

Specified by:

iterator in interface Iterable<N>

nodesStream

default Stream<N> nodesStream()

nodeIDs

default NodeIDs<N> nodeIDs()

getVisualizationHelper

default VisualizationHelper<N,?> getVisualizationHelper()

asNormalGraph

default Graph<N,?> asNormalGraph()

Specified by:

asNormalGraph in interface IndefiniteSimpleGraph<N>