Uses of Interface net.automatalib.graph.IndefiniteGraph (AutomataLib 0.11.0 API)

Packages that use IndefiniteGraph
Package	Description
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.modelchecker.m3c.solver
net.automatalib.ts.modal
net.automatalib.util.graph
net.automatalib.util.graph.copy
net.automatalib.util.graph.traversal

Uses of IndefiniteGraph in net.automatalib.automaton.fsa

Classes in net.automatalib.automaton.fsa that implement IndefiniteGraph
Modifier and Type	Class	Description
`static class`	`FiniteStateAcceptor.FSAGraphView<S,I,A extends FiniteStateAcceptor<S,I>>`

Uses of IndefiniteGraph in net.automatalib.automaton.graph

Classes in net.automatalib.automaton.graph that implement IndefiniteGraph
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 IndefiniteGraph in net.automatalib.automaton.procedural

Classes in net.automatalib.automaton.procedural that implement IndefiniteGraph
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 IndefiniteGraph in net.automatalib.automaton.transducer

Classes in net.automatalib.automaton.transducer that implement IndefiniteGraph
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 IndefiniteGraph in net.automatalib.automaton.vpa

Classes in net.automatalib.automaton.vpa that implement IndefiniteGraph
Modifier and Type Class Description

class SEVPAGraphView<L,I>
Uses of IndefiniteGraph in net.automatalib.brics

Classes in net.automatalib.brics that implement IndefiniteGraph
Modifier and Type Class Description

class AbstractBricsAutomaton.GraphView

Uses of IndefiniteGraph in net.automatalib.graph

Subinterfaces of IndefiniteGraph 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`	`Graph<N,E>`	Graph interface.
`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>`
`interface`	`UniversalIndefiniteGraph<N,E,NP,EP>`	A universal graph, i.e., with (possibly empty) node and edge properties.

Classes in net.automatalib.graph that implement IndefiniteGraph
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.

Uses of IndefiniteGraph in net.automatalib.graph.ads

Subinterfaces of IndefiniteGraph 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 IndefiniteGraph
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 IndefiniteGraph in net.automatalib.graph.base

Classes in net.automatalib.graph.base that implement IndefiniteGraph
Modifier and Type	Class	Description
`class`	`AbstractCompactBidiGraph<NP,EP>`
`class`	`AbstractCompactGraph<E extends CompactEdge<EP>,NP,EP>`

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

Classes in net.automatalib.modelchecker.m3c.solver that implement IndefiniteGraph
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 IndefiniteGraph in net.automatalib.ts.modal

Classes in net.automatalib.ts.modal that implement IndefiniteGraph
Modifier and Type	Class	Description
`static class`	`ModalTransitionSystem.MTSGraphView<S,I,T,TP extends ModalEdgeProperty,M extends ModalTransitionSystem<S,I,T,TP>>`

Uses of IndefiniteGraph in net.automatalib.util.graph

Methods in net.automatalib.util.graph with parameters of type IndefiniteGraph
Modifier and Type	Method	Description
`static <N,E> @Nullable Path<N,E>`	ShortestPaths.`shortestPath(IndefiniteGraph<N,E> graph, N start, int limit, Predicate<? super N> pred)`	Returns a shortest path from the start node to the first node that satisfies the given predicate, if available.
`static <N,E> @Nullable Path<N,E>`	ShortestPaths.`shortestPath(IndefiniteGraph<N,E> graph, N start, int limit, N target)`	Returns a shortest path from the start node to the target node, if available.
`static <N,E> Iterable<Path<N,E>>`	ShortestPaths.`shortestPaths(IndefiniteGraph<N,E> graph, Collection<? extends N> start, int limit, Collection<?> targets)`	Returns a collection of shortest paths from the start nodes to the target nodes, if available.
`static <N,E> Iterable<Path<N,E>>`	ShortestPaths.`shortestPaths(IndefiniteGraph<N,E> graph, Collection<? extends N> start, int limit, Predicate<? super N> pred)`	Returns a collection of shortest paths from the start nodes to all nodes that satisfy the given predicate, if available.
`static <N,E> Iterable<Path<N,E>>`	ShortestPaths.`shortestPaths(IndefiniteGraph<N,E> graph, Collection<? extends N> start, int limit, N target)`	Returns a collection of shortest paths from the start nodes to the target node, if available.
`static <N,E> Iterable<Path<N,E>>`	ShortestPaths.`shortestPaths(IndefiniteGraph<N,E> graph, N start, int limit, Collection<?> targets)`	Returns a collection of shortest paths from the start node to the target nodes, if available.
`static <N,E> Iterable<Path<N,E>>`	ShortestPaths.`shortestPaths(IndefiniteGraph<N,E> graph, N start, int limit, Predicate<? super N> pred)`	Returns a collection of shortest paths from the start node to all nodes that satisfy the given predicate, if available.
`static <N,E> Iterator<Path<N,E>>`	ShortestPaths.`shortestPathsIterator(IndefiniteGraph<N,E> graph, Collection<? extends N> start, int limit, Predicate<? super N> pred)`	Returns an iterator of shortest paths from the start nodes to all nodes that satisfy the given predicate, if available.

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

Methods in net.automatalib.util.graph.copy with parameters of type IndefiniteGraph
Modifier and Type	Method	Description
`static <N1,E1,N2,E2,NP2,EP2> Mapping<N1,N2>`	GraphCopy.`copyTraversal(IndefiniteGraph<N1,E1> in, MutableGraph<N2,E2,NP2,EP2> out, TraversalOrder order, int limit, Collection<? extends N1> initialNodes, Mapping<? super N1,? extends NP2> npMapping, Mapping<? super E1,? extends EP2> epMapping)`

Uses of IndefiniteGraph in net.automatalib.util.graph.traversal

Methods in net.automatalib.util.graph.traversal with parameters of type IndefiniteGraph
Modifier and Type	Method	Description
`static <N,E,D> boolean`	GraphTraversal.`breadthFirst(IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> visitor)`	Traverses the given graph in a breadth-first fashion.
`static <N,E,D> boolean`	GraphTraversal.`breadthFirst(IndefiniteGraph<N,E> graph, int limit, N initialNode, GraphTraversalVisitor<N,E,D> visitor)`	Traverses the given graph in a breadth-first fashion.
`static <N,E,D> void`	GraphTraversal.`breadthFirst(IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> visitor)`	Traverses the given graph in a breadth-first fashion.
`static <N,E,D> void`	GraphTraversal.`breadthFirst(IndefiniteGraph<N,E> graph, N initialNode, GraphTraversalVisitor<N,E,D> visitor)`	Traverses the given graph in a breadth-first fashion.
`static <N,E> Iterator<N>`	GraphTraversal.`breadthFirstIterator(IndefiniteGraph<N,E> graph, Collection<? extends N> start)`	Returns an `Iterator` for the (reachable) nodes of the given graph in breadth-first order.
`static <N,E> Iterable<N>`	GraphTraversal.`breadthFirstOrder(IndefiniteGraph<N,E> graph, Collection<? extends N> start)`	Returns an `Iterable` for the (reachable) nodes of the given graph in breadth-first order.
`static <N,E,D> boolean`	GraphTraversal.`depthFirst(IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> visitor)`	Traverses the given graph in a breadth-first fashion.
`static <N,E,D> boolean`	GraphTraversal.`depthFirst(IndefiniteGraph<N,E> graph, int limit, N initialNode, GraphTraversalVisitor<N,E,D> visitor)`	Traverses the given graph in a depth-first fashion.
`static <N,E,D> void`	GraphTraversal.`depthFirst(IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> visitor)`	Traverses the given graph in a depth-first fashion.
`static <N,E,D> void`	GraphTraversal.`depthFirst(IndefiniteGraph<N,E> graph, N initialNode, GraphTraversalVisitor<N,E,D> visitor)`	Traverses the given graph in a depth-first fashion.
`static <N,E> Iterator<N>`	GraphTraversal.`depthFirstIterator(IndefiniteGraph<N,E> graph, Collection<? extends N> start)`	Returns an `Iterator` for the (reachable) nodes of the given graph in depth-first order.
`static <N,E> Iterable<N>`	GraphTraversal.`depthFirstOrder(IndefiniteGraph<N,E> graph, Collection<? extends N> start)`	Returns an `Iterable` for the (reachable) nodes of the given graph in depth-first order.
`static <N,E,D> boolean`	GraphTraversal.`traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, int limit, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> visitor)`	Traverses the given graph in a given order.
`static <N,E,D> boolean`	GraphTraversal.`traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, int limit, N initialNode, GraphTraversalVisitor<N,E,D> visitor)`	Traverses the given graph in a given order.
`static <N,E,D> void`	GraphTraversal.`traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, Collection<? extends N> initialNodes, GraphTraversalVisitor<N,E,D> visitor)`	Traverses the given graph in a given order.
`static <N,E,D> void`	GraphTraversal.`traverse(TraversalOrder order, IndefiniteGraph<N,E> graph, N initialNode, GraphTraversalVisitor<N,E,D> visitor)`	Traverses the given graph in a given order.