Uses of Interface
net.automatalib.graphs.Graph

Packages that use Graph

Package	Description
net.automatalib.automata	This package contains the basic interfaces for automata.
net.automatalib.automata.fsa
net.automatalib.automata.graphs
net.automatalib.automata.transout
net.automatalib.graphs
net.automatalib.graphs.ads
net.automatalib.graphs.concepts

Uses of Graph in net.automatalib.automata

Methods in net.automatalib.automata that return Graph

Modifier and Type	Method and Description
default Graph<?,?>	FiniteAlphabetAutomaton.graphView()
default Graph<S,TransitionEdge<I,T>>	FiniteAlphabetAutomaton.transitionGraphView()
default Graph<S,TransitionEdge<I,T>>	Automaton.transitionGraphView(Collection<? extends I> inputs) Obtains a graph view of the transition graph of this automaton, taking into account the specified input symbols.

Uses of Graph in net.automatalib.automata.fsa

Classes in net.automatalib.automata.fsa that implement Graph

Modifier and Type	Class and Description
static class	FiniteStateAcceptor.FSAGraphView<S,I,A extends FiniteStateAcceptor<S,I>>

Uses of Graph in net.automatalib.automata.graphs

Classes in net.automatalib.automata.graphs that implement Graph

Modifier and Type	Class and Description
class	AbstractAutomatonGraphView<S,A extends Automaton<S,?,?>,E>
class	AutomatonGraphView<S,I,T,A extends Automaton<S,I,T>>
class	UniversalAutomatonGraphView<S,I,T,SP,TP,A extends UniversalAutomaton<S,I,T,SP,TP>>

Uses of Graph in net.automatalib.automata.transout

Classes in net.automatalib.automata.transout that implement Graph

Modifier and Type	Class and Description
static class	MealyMachine.MealyGraphView<S,I,T,O,A extends MealyMachine<S,I,T,O>>

Uses of Graph in net.automatalib.graphs

Subinterfaces of Graph in net.automatalib.graphs

Modifier and Type	Interface and Description
interface	AcceptanceGraph<N,E> Interface for finite graphs that embody the concept of node acceptance.
interface	BidirectionalGraph<N,E> Interface for bidirectional graph.
interface	FiniteKripkeStructure<N,E,AP> A Kripke structure is a graph which has sets of atomic properties assigned to its nodes.
interface	FiniteKTS<N,E,AP,L> A finite Kripke Transition System combines the properties of both a labeled transition system and a Kripke structure.
interface	FiniteLTS<N,E,L> A finite LTS is an IndefiniteLTS with a finite number of nodes.
interface	MutableGraph<N,E,NP,EP> A graph that allows modification.
interface	ShrinkableGraph<N,E> A graph that supports (desirably efficient) removal of nodes and edges.
interface	UndirectedGraph<N,E> An undirected graph.
interface	UniversalGraph<N,E,NP,EP>

Classes in net.automatalib.graphs that implement Graph

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

Methods in net.automatalib.graphs that return Graph

Modifier and Type	Method and Description
default Graph<N,E>	Graph.asNormalGraph()
default Graph<N,?>	SimpleGraph.asNormalGraph()

Uses of Graph in net.automatalib.graphs.ads

Subinterfaces of Graph in net.automatalib.graphs.ads

Modifier and Type	Interface and Description
interface	ADSNode<S,I,O> A (simplified) node in an adaptive distinguishing sequence.
interface	RecursiveADSNode<S,I,O,N extends RecursiveADSNode<S,I,O,N>> An interface representing a node in an adaptive distinguishing sequence (which essentially forms a decision tree).

Uses of Graph in net.automatalib.graphs.concepts

Methods in net.automatalib.graphs.concepts that return Graph

Modifier and Type	Method and Description
Graph<?,?>	GraphViewable.graphView()