Modifier and Type | Class and Description |
---|---|
static class |
FiniteStateAcceptor.FSAGraphView<S,I,A extends FiniteStateAcceptor<S,I>> |
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>> |
Modifier and Type | Class and 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>> |
Modifier and Type | Class and Description |
---|---|
class |
SimpleMapGraph<N>
A very simple graph realization, where nodes can be arbitrary Java objects.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractOneSEVPA<L,I>
Abstract class for 1-SEVPAs that implements functionality shared across different subtypes.
|
class |
DefaultOneSEVPA<I>
Default implementation for 1-SEVPA.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractBricsAutomaton.GraphView |
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 |
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 |
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.
|
Modifier and Type | Class and Description |
---|---|
static class |
IndefiniteSimpleGraph.NormalGraphView<N,G extends IndefiniteSimpleGraph<N>> |
static class |
SimpleGraph.NormalGraphView<N,G extends SimpleGraph<N>> |
Modifier and Type | Method and Description |
---|---|
default IndefiniteGraph<N,E> |
IndefiniteGraph.asNormalGraph() |
default IndefiniteGraph<N,?> |
IndefiniteSimpleGraph.asNormalGraph() |
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).
|
Modifier and Type | Class and 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.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractCompactGraph<E extends CompactEdge<EP>,NP,EP> |
class |
AbstractCompactNPGraph<E extends CompactEdge<EP>,NP,EP> |
class |
AbstractCompactSimpleGraph<E extends CompactEdge<EP>,EP> |
class |
CompactGraph<NP,EP> |
class |
CompactSimpleBidiGraph<EP> |
class |
CompactSimpleGraph<EP> |
Modifier and Type | Interface and Description |
---|---|
static interface |
IncrementalDFABuilder.GraphView<I,N,E> |
Modifier and Type | Class and Description |
---|---|
protected static class |
AbstractIncrementalDFABuilder.AbstractGraphView<I,N,E> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractIncrementalDFADAGBuilder.GraphView |
Modifier and Type | Class and Description |
---|---|
class |
IncrementalDFATreeBuilder.GraphView |
Modifier and Type | Interface and Description |
---|---|
static interface |
IncrementalMealyBuilder.GraphView<I,O,N,E> |
Modifier and Type | Class and Description |
---|---|
static class |
AbstractIncrementalMealyBuilder.AbstractGraphView<I,O,N,E> |
Modifier and Type | Class and Description |
---|---|
class |
IncrementalMealyDAGBuilder.GraphView |
Modifier and Type | Class and Description |
---|---|
class |
AbstractIncrementalMealyTreeBuilder.GraphView |
Modifier and Type | Class and Description |
---|---|
class |
ProductOneSEVPA<L1,L2,I>
Production automaton that allows to join two given 1-SEVPAs.
|
Modifier and Type | Method and Description |
---|---|
static <N,E> Path<N,E> |
Graphs.findShortestPath(IndefiniteGraph<N,E> graph,
int limit,
N start,
Collection<? extends N> targets) |
static <N,E> Path<N,E> |
Graphs.findShortestPath(IndefiniteGraph<N,E> graph,
int limit,
N start,
Predicate<? super N> targetPred) |
static <N,E> Path<N,E> |
ShortestPaths.shortestPath(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
Collection<?> targets) |
static <N,E> Path<N,E> |
ShortestPaths.shortestPath(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
N target) |
static <N,E> Path<N,E> |
ShortestPaths.shortestPath(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
Predicate<? super N> targetPred) |
static <N,E> Path<N,E> |
ShortestPaths.shortestPath(IndefiniteGraph<N,E> graph,
N start,
int limit,
Collection<?> targets) |
static <N,E> Path<N,E> |
ShortestPaths.shortestPath(IndefiniteGraph<N,E> graph,
N start,
int limit,
N target) |
static <N,E> Path<N,E> |
ShortestPaths.shortestPath(IndefiniteGraph<N,E> graph,
N start,
int limit,
Predicate<? super N> targetPred) |
static <N,E> Iterable<Path<N,E>> |
ShortestPaths.shortestPaths(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
Collection<?> targets) |
static <N,E> Iterable<Path<N,E>> |
ShortestPaths.shortestPaths(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
N target) |
static <N,E> Iterable<Path<N,E>> |
ShortestPaths.shortestPaths(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
Predicate<? super N> targetPred) |
static <N,E> Iterable<Path<N,E>> |
ShortestPaths.shortestPaths(IndefiniteGraph<N,E> graph,
N start,
int limit,
Collection<?> targets) |
static <N,E> Iterable<Path<N,E>> |
ShortestPaths.shortestPaths(IndefiniteGraph<N,E> graph,
N start,
int limit,
N target) |
static <N,E> Iterable<Path<N,E>> |
ShortestPaths.shortestPaths(IndefiniteGraph<N,E> graph,
N start,
int limit,
Predicate<? super N> targetPred) |
static <N,E> Iterator<Path<N,E>> |
ShortestPaths.shortestPathsIterator(IndefiniteGraph<N,E> graph,
Collection<? extends N> start,
int limit,
Predicate<? super N> targetPred) |
Path<N,E> |
Path.PathData.toPath(IndefiniteGraph<N,E> graph) |
Modifier and Type | Method and Description |
---|---|
static <N1,E1,N2,E2,NP2,EP2> |
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) |
Modifier and Type | Method and Description |
---|---|
static <N,E> Iterator<N> |
GraphTraversal.bfIterator(IndefiniteGraph<N,E> graph,
Collection<? extends N> start) |
static <N,E,D> boolean |
GraphTraversal.breadthFirst(IndefiniteGraph<N,E> graph,
Collection<? extends N> initialNodes,
GraphTraversalVisitor<N,E,D> visitor) |
static <N,E,D> boolean |
GraphTraversal.breadthFirst(IndefiniteGraph<N,E> graph,
int limit,
Collection<? extends N> initialNodes,
GraphTraversalVisitor<N,E,D> vis) |
static <N,E,D> boolean |
GraphTraversal.breadthFirst(IndefiniteGraph<N,E> graph,
int limit,
N initialNode,
GraphTraversalVisitor<N,E,D> visitor) |
static <N,E,D> boolean |
GraphTraversal.breadthFirst(IndefiniteGraph<N,E> graph,
N initialNode,
GraphTraversalVisitor<N,E,D> visitor) |
static <N,E> Iterable<N> |
GraphTraversal.breadthFirstOrder(IndefiniteGraph<N,E> graph,
Collection<? extends N> start) |
static <N,E,D> boolean |
GraphTraversal.depthFirst(IndefiniteGraph<N,E> graph,
Collection<? extends N> initialNodes,
GraphTraversalVisitor<N,E,D> vis) |
static <N,E,D> boolean |
GraphTraversal.depthFirst(IndefiniteGraph<N,E> graph,
int limit,
Collection<? extends N> initialNodes,
GraphTraversalVisitor<N,E,D> vis) |
static <N,E,D> boolean |
GraphTraversal.depthFirst(IndefiniteGraph<N,E> graph,
int limit,
N initNode,
GraphTraversalVisitor<N,E,D> vis) |
static <N,E,D> boolean |
GraphTraversal.depthFirst(IndefiniteGraph<N,E> graph,
N initNode,
GraphTraversalVisitor<N,E,D> vis) |
static <N,E> Iterable<N> |
GraphTraversal.depthFirstOrder(IndefiniteGraph<N,E> graph,
Collection<? extends N> start) |
static <N,E> Iterator<N> |
GraphTraversal.dfIterator(IndefiniteGraph<N,E> graph,
Collection<? extends N> start) |
static <N,E,D> boolean |
GraphTraversal.dfs(IndefiniteGraph<N,E> graph,
Collection<? extends N> initialNodes,
DFSVisitor<? super N,? super E,D> visitor) |
static <N,E,D> boolean |
GraphTraversal.dfs(IndefiniteGraph<N,E> graph,
int limit,
Collection<? extends N> initialNodes,
DFSVisitor<? super N,? super E,D> visitor) |
static <N,E,D> boolean |
GraphTraversal.dfs(IndefiniteGraph<N,E> graph,
N initialNode,
DFSVisitor<? super N,? super E,D> visitor) |
static <N,E,D> boolean |
GraphTraversal.traverse(TraversalOrder order,
IndefiniteGraph<N,E> graph,
Collection<? extends N> initialNodes,
GraphTraversalVisitor<N,E,D> vis) |
static <N,E,D> boolean |
GraphTraversal.traverse(TraversalOrder order,
IndefiniteGraph<N,E> graph,
int limit,
Collection<? extends N> initialNodes,
GraphTraversalVisitor<N,E,D> vis) |
static <N,E,D> boolean |
GraphTraversal.traverse(TraversalOrder order,
IndefiniteGraph<N,E> graph,
int limit,
N initialNode,
GraphTraversalVisitor<N,E,D> vis) |
static <N,E,D> boolean |
GraphTraversal.traverse(TraversalOrder order,
IndefiniteGraph<N,E> graph,
N initialNode,
GraphTraversalVisitor<N,E,D> vis) |
Modifier and Type | Class and Description |
---|---|
class |
SharedSuffixTrie<I> |
class |
SuffixTrie<I> |
Copyright © 2019. All rights reserved.