Modifier and Type | Class and Description |
---|---|
static class |
FiniteStateAcceptor.FSAGraphView<S,I,A extends FiniteStateAcceptor<S,I>> |
Modifier and Type | Class and Description |
---|---|
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 |
AbstractBricsAutomaton.GraphView |
Modifier and Type | Interface and Description |
---|---|
interface |
MutableGraph<N,E,NP,EP>
A graph that allows modification.
|
interface |
UniversalGraph<N,E,NP,EP> |
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 | Class and Description |
---|---|
class |
SimpleMapGraph<N>
A very simple graph realization, where nodes can be arbitrary Java objects.
|
Modifier and Type | Method and Description |
---|---|
static <N1,E1,N2,E2,NP2,EP2> |
GraphCopy.copyTraversal(UniversalIndefiniteGraph<N1,E1,? extends NP2,? extends EP2> in,
MutableGraph<N2,E2,NP2,EP2> out,
TraversalOrder order,
int limit,
Collection<? extends N1> initialNodes) |
static <N1,E1,NP1,EP1,N2,E2,NP2,EP2> |
GraphCopy.copyUniversalTraversal(UniversalIndefiniteGraph<N1,E1,NP1,EP1> in,
MutableGraph<N2,E2,NP2,EP2> out,
TraversalOrder order,
int limit,
Collection<? extends N1> initialNodes,
Mapping<? super NP1,? extends NP2> npConversion,
Mapping<? super EP1,? extends EP2> epConversion) |
Copyright © 2020. All rights reserved.