Package | Description |
---|---|
net.automatalib.graphs.base.compact | |
net.automatalib.graphs.map | |
net.automatalib.serialization.dot | |
net.automatalib.util.graphs.copy |
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 | Class and Description |
---|---|
class |
DOTGraphParser<NP,EP,G extends MutableGraph<?,?,NP,EP>>
General-purpose DOT parser for
MutableGraph s. |
Modifier and Type | Method and Description |
---|---|
static <NP,EP,G extends MutableGraph<?,?,NP,EP>> |
DOTParsers.graph(Supplier<G> creator,
Function<Map<String,String>,NP> nodeParser,
Function<Map<String,String>,EP> edgeParser)
Parser for (directed)
Graph s with a custom graph instance and custom node and edge attributes. |
Modifier and Type | Method and Description |
---|---|
static <N1,E1,N2,E2,NP2,EP2> |
GraphCopy.copyPlain(Graph<N1,E1> in,
MutableGraph<N2,E2,NP2,EP2> out,
Mapping<? super N1,? extends NP2> npMapping,
Mapping<? super E1,? extends EP2> epMapping) |
static <N1,E1,N2,E2,NP2,EP2> |
GraphCopy.copyPlain(UniversalGraph<N1,E1,? extends NP2,? extends EP2> in,
MutableGraph<N2,E2,NP2,EP2> out) |
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) |
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.copyUniversalPlain(UniversalGraph<N1,E1,NP1,EP1> in,
MutableGraph<N2,E2,NP2,EP2> out,
Mapping<? super NP1,? extends NP2> npConversion,
Mapping<? super EP1,? extends EP2> epConversion) |
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.