Modifier and Type | Method and Description |
---|---|
default Graph<?,?> |
FiniteAlphabetAutomaton.graphView() |
default Graph<S,TransitionEdge<I,T>> |
FiniteAlphabetAutomaton.transitionGraphView() |
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. |
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 |
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 |
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> |
Modifier and Type | Class and Description |
---|---|
static class |
SimpleGraph.NormalGraphView<N,G extends SimpleGraph<N>> |
Modifier and Type | Method and Description |
---|---|
default Graph<N,E> |
Graph.asNormalGraph() |
default Graph<N,?> |
SimpleGraph.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 | Method and Description |
---|---|
Graph<?,?> |
GraphViewable.graphView() |
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 |
---|---|
Graph<?,?> |
IncrementalConstruction.asGraph()
Retrieves a graph view of the current state of the construction.
|
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 | Method and 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) |
Modifier and Type | Method and Description |
---|---|
static <S,I,T> Graph<S,TransitionEdge<I,T>> |
Automata.asGraph(Automaton<S,I,T> automaton,
Collection<? extends I> inputs) |
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> 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,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.
|
Modifier and Type | Method and Description |
---|---|
static <N,E> APSPResult<N,E> |
FloydWarshallAPSP.findAPSP(Graph<N,E> graph,
EdgeWeights<E> edgeWeights) |
Constructor and Description |
---|
FloydWarshallAPSP(Graph<N,E> graph,
EdgeWeights<E> ew) |
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) |
Modifier and Type | Method and 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.
|
Constructor and Description |
---|
TarjanSCCVisitor(Graph<N,E> graph,
SCCListener<N> listener)
Constructor.
|
Modifier and Type | Method and 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.
|
Constructor and Description |
---|
DijkstraSSSP(Graph<N,E> graph,
N init,
EdgeWeights<E> edgeWeights)
Constructor.
|
Modifier and Type | Class and Description |
---|---|
class |
SharedSuffixTrie<I> |
class |
SuffixTrie<I> |
Modifier and Type | Method and Description |
---|---|
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) |
<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.
|
<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,
VisualizationHelper<N,? super E>... additionalHelpers) |
Modifier and Type | Method and 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) |
Modifier and Type | Method and 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) |
Copyright © 2020. All rights reserved.