Uses of Interface
net.automatalib.graphs.IndefiniteSimpleGraph

Packages that use IndefiniteSimpleGraph

Package	Description
net.automatalib.automata.fsa
net.automatalib.automata.graphs
net.automatalib.automata.transout
net.automatalib.graphs
net.automatalib.graphs.ads

Uses of IndefiniteSimpleGraph in net.automatalib.automata.fsa

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

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

Uses of IndefiniteSimpleGraph in net.automatalib.automata.graphs

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

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 IndefiniteSimpleGraph in net.automatalib.automata.transout

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

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

Uses of IndefiniteSimpleGraph in net.automatalib.graphs

Classes in net.automatalib.graphs with type parameters of type IndefiniteSimpleGraph

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

Subinterfaces of IndefiniteSimpleGraph 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	Graph<N,E> Graph interface.
interface	IndefiniteGraph<N,E> Interface for an (indefinite) graph structure.
interface	IndefiniteLTS<N,E,L> A labeled transition system is a graph with labels attached to its edges.
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	SimpleGraph<N> The finite version of a IndefiniteSimpleGraph.
interface	UndirectedGraph<N,E> An undirected graph.
interface	UniversalGraph<N,E,NP,EP>
interface	UniversalIndefiniteGraph<N,E,NP,EP> A universal graph, i.e., with (possibly empty) node and edge properties.

Classes in net.automatalib.graphs that implement IndefiniteSimpleGraph

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

Fields in net.automatalib.graphs declared as IndefiniteSimpleGraph

Modifier and Type	Field and Description
protected G	IndefiniteSimpleGraph.NormalGraphView.simpleGraph

Uses of IndefiniteSimpleGraph in net.automatalib.graphs.ads

Subinterfaces of IndefiniteSimpleGraph 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).