Uses of Interface
net.automatalib.graph.Graph

Packages that use Graph

Package	Description
net.automatalib.automaton	This package (including sub-packages) contains the basic classes concerning automata.
net.automatalib.automaton.fsa
net.automatalib.automaton.graph
net.automatalib.automaton.procedural
net.automatalib.automaton.transducer
net.automatalib.automaton.vpa
net.automatalib.brics	This package contains adapter classes for treating the Automaton objects from the BRICS library as AutomataLib models.
net.automatalib.graph	This package (including sub-packages) contains the basic classes concerning graphs.
net.automatalib.graph.ads
net.automatalib.graph.base
net.automatalib.graph.concept
net.automatalib.incremental	This package (including sub-packages) contains several approaches for the incremental construction of automaton-like structures.
net.automatalib.incremental.dfa
net.automatalib.incremental.dfa.tree
net.automatalib.incremental.mealy.dag
net.automatalib.incremental.mealy.tree
net.automatalib.incremental.moore.dag
net.automatalib.incremental.moore.tree
net.automatalib.modelchecker.m3c.solver
net.automatalib.serialization.dot
net.automatalib.ts.modal
net.automatalib.util.automaton
net.automatalib.util.graph
net.automatalib.util.graph.apsp
net.automatalib.util.graph.copy
net.automatalib.util.graph.scc
net.automatalib.util.graph.sssp
net.automatalib.visualization	This package contains several approaches for the visualization of the different types of automata, transition systems, and graphs supported by AutomataLib.
net.automatalib.visualization.dot
net.automatalib.visualization.jung

Uses of Graph in net.automatalib.automaton

Methods in net.automatalib.automaton that return Graph

Modifier and Type	Method	Description
default Graph<?,?>	FiniteAlphabetAutomaton.graphView()
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.
default Graph<S,TransitionEdge<I,T>>	FiniteAlphabetAutomaton.transitionGraphView()

Uses of Graph in net.automatalib.automaton.fsa

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

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

Uses of Graph in net.automatalib.automaton.graph

Classes in net.automatalib.automaton.graph that implement Graph

Modifier and Type	Class	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.automaton.procedural

Classes in net.automatalib.automaton.procedural that implement Graph

Modifier and Type	Class	Description
class	ProceduralGraphView<S,I>	Graph representation of a ProceduralSystem that displays all states of its sub-procedures once, i.e., without incorporating execution semantics such as stack contents.

Uses of Graph in net.automatalib.automaton.transducer

Classes in net.automatalib.automaton.transducer that implement Graph

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

Uses of Graph in net.automatalib.automaton.vpa

Classes in net.automatalib.automaton.vpa that implement Graph

Modifier and Type	Class	Description
class	SEVPAGraphView<L,I>

Methods in net.automatalib.automaton.vpa that return Graph

Modifier and Type	Method	Description
default Graph<L,SEVPAGraphView.SevpaViewEdge<L,I>>	SEVPA.graphView()

Uses of Graph in net.automatalib.brics

Classes in net.automatalib.brics that implement Graph

Modifier and Type	Class	Description
class	AbstractBricsAutomaton.GraphView

Uses of Graph in net.automatalib.graph

Subinterfaces of Graph in net.automatalib.graph

Modifier and Type	Interface	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	FiniteLabeledGraph<N,E,L>
interface	MutableGraph<N,E,NP,EP>	A graph that allows modification.
interface	MutableProceduralModalProcessGraph<N,L,E,AP,TP extends MutableProceduralModalEdgeProperty>	A mutable version of the ProceduralModalProcessGraph.
interface	MutableUniversalBidirectionalGraph<N,E,NP,EP>
interface	ProceduralModalProcessGraph<N,L,E,AP,TP extends ProceduralModalEdgeProperty>	Represents a Procedural Modal Transition System as defined in the paper M3C: Modal Meta Model Checking.
interface	ShrinkableGraph<N,E>	A graph that supports (desirably efficient) removal of nodes and edges.
interface	UndirectedGraph<N,E>	An undirected graph.
interface	UniversalBidirectionalGraph<N,E,NP,EP>
interface	UniversalGraph<N,E,NP,EP>

Classes in net.automatalib.graph that implement Graph

Modifier and Type	Class	Description
class	CFMPSGraphView<N,L,E,AP>	Graph representation of a ContextFreeModalProcessSystem that displays all nodes of its sub-procedures once, i.e., without incorporating execution semantics such as expansion.
class	CompactBidiGraph<NP,EP>
class	CompactGraph<NP,EP>
class	CompactPMPG<L,AP>
class	CompactSimpleBidiGraph<EP>
class	CompactSimpleGraph<EP>
class	SimpleMapGraph<N>	A very simple graph realization, where nodes can be arbitrary Java objects.

Methods in net.automatalib.graph that return Graph

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

Uses of Graph in net.automatalib.graph.ads

Subinterfaces of Graph in net.automatalib.graph.ads

Modifier and Type	Interface	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).

Classes in net.automatalib.graph.ads that implement Graph

Modifier and Type	Class	Description
class	AbstractRecursiveADSLeafNode<S,I,O,N extends RecursiveADSNode<S,I,O,N>>	An abstract implementation of a leaf node, that may be used by other ADS-extending classes.
class	AbstractRecursiveADSSymbolNode<S,I,O,N extends RecursiveADSNode<S,I,O,N>>	An abstract implementation of a symbol node, that may be used by other ADS-extending classes.
class	ADSLeafNode<S,I,O>	An ADS-specific implementation of a leaf node.
class	ADSSymbolNode<S,I,O>	An ADS-specific implementation of a symbol node.

Uses of Graph in net.automatalib.graph.base

Classes in net.automatalib.graph.base that implement Graph

Modifier and Type	Class	Description
class	AbstractCompactBidiGraph<NP,EP>
class	AbstractCompactGraph<E extends CompactEdge<EP>,NP,EP>

Uses of Graph in net.automatalib.graph.concept

Methods in net.automatalib.graph.concept that return Graph

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

Uses of Graph in net.automatalib.incremental

Methods in net.automatalib.incremental that return Graph

Modifier and Type	Method	Description
Graph<?,?>	IncrementalConstruction.asGraph()	Retrieves a graph view of the current state of the construction.

Uses of Graph in net.automatalib.incremental.dfa

Methods in net.automatalib.incremental.dfa that return Graph

Modifier and Type	Method	Description
Graph<?,?>	IncrementalDFABuilder.asGraph()

Uses of Graph in net.automatalib.incremental.dfa.tree

Methods in net.automatalib.incremental.dfa.tree that return Graph

Modifier and Type	Method	Description
Graph<?,?>	IncrementalDFATreeBuilder.asGraph()
Graph<?,?>	IncrementalPCDFATreeBuilder.asGraph()

Uses of Graph in net.automatalib.incremental.mealy.dag

Methods in net.automatalib.incremental.mealy.dag that return Graph

Modifier and Type	Method	Description
Graph<?,?>	IncrementalMealyDAGBuilder.asGraph()

Uses of Graph in net.automatalib.incremental.mealy.tree

Methods in net.automatalib.incremental.mealy.tree that return Graph

Modifier and Type	Method	Description
Graph<?,?>	DynamicIncrementalMealyTreeBuilder.asGraph()

Uses of Graph in net.automatalib.incremental.moore.dag

Methods in net.automatalib.incremental.moore.dag that return Graph

Modifier and Type	Method	Description
Graph<?,?>	IncrementalMooreDAGBuilder.asGraph()

Uses of Graph in net.automatalib.incremental.moore.tree

Methods in net.automatalib.incremental.moore.tree that return Graph

Modifier and Type	Method	Description
Graph<?,?>	IncrementalMooreTreeBuilder.asGraph()

Uses of Graph in net.automatalib.modelchecker.m3c.solver

Classes in net.automatalib.modelchecker.m3c.solver that implement Graph

Modifier and Type	Class	Description
class	WitnessTree<L,AP>	A tree-like Graph that represents the BFS-style exploration of the tableau generated by the WitnessTreeExtractor.

Uses of Graph in net.automatalib.serialization.dot

Methods in net.automatalib.serialization.dot with parameters of type Graph

Modifier and Type	Method	Description
static <N,E> void	GraphDOT.write(Graph<N,E> graph, Appendable a)	Renders a Graph in the GraphVIZ DOT format.
static <N,E> void	GraphDOT.write(Graph<N,E> graph, Appendable a, List<VisualizationHelper<N,? super E>> additionalHelpers)	Renders a Graph in the GraphVIZ DOT format.
static <N,E> void	GraphDOT.write(Graph<N,E> graph, Appendable a, VisualizationHelper<N,? super E>... additionalHelpers)	Renders a Graph in the GraphVIZ DOT format.
void	DOTSerializationProvider.writeModel(OutputStream os, Graph<N,E> model)

Method parameters in net.automatalib.serialization.dot with type arguments of type Graph

Modifier and Type	Method	Description
static void	GraphDOT.write(List<Graph<?,?>> graphs, Appendable a)	Renders a list of Graphs as clusters (subgraphs) in the GraphVIZ DOT format.

Uses of Graph in net.automatalib.ts.modal

Classes in net.automatalib.ts.modal that implement Graph

Modifier and Type	Class	Description
static class	ModalTransitionSystem.MTSGraphView<S,I,T,TP extends ModalEdgeProperty,M extends ModalTransitionSystem<S,I,T,TP>>

Uses of Graph in net.automatalib.util.automaton

Methods in net.automatalib.util.automaton that return Graph

Modifier and Type	Method	Description
static <S,I,T> Graph<S,TransitionEdge<I,T>>	Automata.asGraph(Automaton<S,I,T> automaton, Collection<? extends I> inputs)

Uses of Graph in net.automatalib.util.graph

Methods in net.automatalib.util.graph with parameters of type Graph

Modifier and Type	Method	Description
static <N,E> List<List<N>>	Graphs.collectSCCs(Graph<N,E> graph)	Collects all strongly-connected components in a graph.
static <N,E> APSPResult<N,E>	Graphs.findAPSP(Graph<N,E> graph, EdgeWeights<E> edgeWeights)	Computes the shortest paths between all pairs of nodes in a graph, using the Floyd-Warshall dynamic programming algorithm.
static <N,E> void	Graphs.findSCCs(Graph<N,E> graph, SCCListener<N> sccListener)	Find all strongly-connected components in a graph.
static <N,E> SSSPResult<N,E>	Graphs.findSSSP(Graph<N,E> graph, N init, EdgeWeights<E> edgeWeights)	Computes the shortest paths between a single source node and all other nodes in a graph, using Dijkstra's algorithm.
static <N,E> Mapping<N,@Nullable Collection<E>>	Graphs.incomingEdges(Graph<N,E> graph)
static <N,E> List<N>	Graphs.toNodeList(List<E> edgeList, Graph<N,E> graph, N init)	Converts a list of edges into a corresponding list of nodes.

Uses of Graph in net.automatalib.util.graph.apsp

Methods in net.automatalib.util.graph.apsp with parameters of type Graph

Modifier and Type	Method	Description
static <N,E> APSPResult<N,E>	FloydWarshallAPSP.findAPSP(Graph<N,E> graph, EdgeWeights<E> edgeWeights)

Constructors in net.automatalib.util.graph.apsp with parameters of type Graph

Constructor	Description
FloydWarshallAPSP(Graph<N,E> graph, EdgeWeights<E> ew)

Uses of Graph in net.automatalib.util.graph.copy

Methods in net.automatalib.util.graph.copy with parameters of type Graph

Modifier and Type	Method	Description
static <N1,E1,N2,E2,NP2,EP2> Mapping<N1,N2>	GraphCopy.copyPlain(Graph<N1,E1> in, MutableGraph<N2,E2,NP2,EP2> out, Mapping<? super N1,? extends NP2> npMapping, Mapping<? super E1,? extends EP2> epMapping)

Uses of Graph in net.automatalib.util.graph.scc

Methods in net.automatalib.util.graph.scc with parameters of type Graph

Modifier and Type	Method	Description
static <N,E> List<List<N>>	SCCs.collectSCCs(Graph<N,E> graph)	Collects all strongly-connected components in a graph.
static <N,E> void	SCCs.findSCCs(Graph<N,E> graph, SCCListener<N> listener)	Find all strongly-connected components in a graph.

Constructors in net.automatalib.util.graph.scc with parameters of type Graph

Constructor	Description
TarjanSCCVisitor(Graph<N,E> graph, SCCListener<N> listener)	Constructor.

Uses of Graph in net.automatalib.util.graph.sssp

Methods in net.automatalib.util.graph.sssp with parameters of type Graph

Modifier and Type	Method	Description
static <N,E> SSSPResult<N,E>	DijkstraSSSP.findSSSP(Graph<N,E> graph, N init, EdgeWeights<E> edgeWeights)	Search for the shortest paths from a single source node in a graph.

Constructors in net.automatalib.util.graph.sssp with parameters of type Graph

Constructor	Description
DijkstraSSSP(Graph<N,E> graph, N init, EdgeWeights<E> edgeWeights)	Constructor.

Uses of Graph in net.automatalib.visualization

Methods in net.automatalib.visualization with parameters of type Graph

Modifier and Type	Method	Description
<N,E> void	DummyVP.visualize(Graph<N,E> graph, List<VisualizationHelper<N,? super E>> additionalHelpers, boolean modal, Map<String,String> options)
static <N,E> void	Visualization.visualize(Graph<N,E> graph)
static <N,E> void	Visualization.visualize(Graph<N,E> graph, boolean modal)
static <N,E> void	Visualization.visualize(Graph<N,E> graph, boolean modal, Map<String,String> options)
static <N,E> void	Visualization.visualize(Graph<N,E> graph, boolean modal, Map<String,String> options, VisualizationHelper<N,? super E>... additionalHelpers)
static <N,E> void	Visualization.visualize(Graph<N,E> graph, boolean modal, VisualizationHelper<N,? super E>... additionalHelpers)
static <N,E> void	Visualization.visualize(Graph<N,E> graph, VisualizationHelper<N,? super E>... additionalHelpers)
<N,E> void	VisualizationProvider.visualize(Graph<N,E> graph, List<VisualizationHelper<N,? super E>> additionalHelpers, boolean modal, Map<String,String> visOptions)	Visualizes the given graph by means of executing the visualization implementation.

Uses of Graph in net.automatalib.visualization.dot

Methods in net.automatalib.visualization.dot with parameters of type Graph

Modifier and Type	Method	Description
<N,E> void	GraphVizBrowserVisualizationProvider.visualize(Graph<N,E> graph, List<VisualizationHelper<N,? super E>> additionalHelpers, boolean modal, Map<String,String> visOptions)
<N,E> void	GraphVizSwingVisualizationProvider.visualize(Graph<N,E> graph, List<VisualizationHelper<N,? super E>> additionalHelpers, boolean modal, Map<String,String> visOptions)

Uses of Graph in net.automatalib.visualization.jung

Methods in net.automatalib.visualization.jung with parameters of type Graph

Modifier and Type	Method	Description
static <N,E> DirectedGraph<JungGraphVisualizationProvider.NodeVisualization,JungGraphVisualizationProvider.EdgeVisualization>	JungGraphVisualizationProvider.createVisualizationGraph(Graph<N,E> graph, List<VisualizationHelper<N,? super E>> additionalHelpers)
<N,E> void	JungGraphVisualizationProvider.visualize(Graph<N,E> graph, List<VisualizationHelper<N,? super E>> additionalHelpers, boolean modal, Map<String,String> options)