Modifier and Type | Method and Description |
---|---|
static <N,E> List<List<N>> |
GraphAlgorithms.collectSCCs(Graph<N,E> graph)
Collects all strongly-connected components in a graph.
|
static <N,E> APSPResult<N,E> |
GraphAlgorithms.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 |
GraphAlgorithms.findSCCs(Graph<N,E> graph,
SCCListener<N> sccListener)
Find all strongly-connected components in a graph.
|
static <N,E> SSSPResult<N,E> |
GraphAlgorithms.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> List<N> |
GraphAlgorithms.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 <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 |
AbstractCompactDeterministic<I,T,SP,TP> |
class |
AbstractCompactSimpleDet<I,SP> |
class |
UniversalCompactSimpleDet<I,SP> |
Modifier and Type | Class and Description |
---|---|
class |
FastMutableDet<S extends FastDetState<S,T>,I,T,SP,TP> |
class |
FastMutableNondet<S extends FastNondetState<S,T>,I,T,SP,TP> |
Modifier and Type | Class and Description |
---|---|
class |
FastDFA<I> |
class |
FastNFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
CompactDFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractAutomatonGraph<S,I,T,SP,TP> |
Modifier and Type | Class and Description |
---|---|
class |
FastMealy<I,O>
A fast implementation of a Mealy machine.
|
class |
FastMoore<I,O>
A fast implementation of a Moore automaton.
|
class |
FastProbMealy<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
CompactMealy<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractBricsAutomaton
Base class for Brics automata adapters.
|
class |
BricsDFA
Adapter class for wrapping a Brics automaton as a
DFA . |
class |
BricsNFA
Adapter class for wrapping a Brics automaton as an
NFA . |
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 |
---|---|
class |
AbstractGraph<N,E> |
class |
AbstractMutableGraph<N,E,NP,EP> |
Modifier and Type | Method and Description |
---|---|
static <N,E> Iterator<N> |
AbstractGraph.iterator(Graph<N,E> $this)
Provides a realization for
Iterable.iterator() relying on
getNodes() . |
static <N,E> NodeIDs<N> |
AbstractGraph.nodeIDs(Graph<N,E> $this) |
static <N,E> int |
AbstractGraph.size(Graph<N,E> $this)
Provides a realization for
size() relying on
getNodes() . |
Constructor and Description |
---|
SimpleNodeIDs(Graph<N,?> graph) |
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 |
---|---|
interface |
DOTPlottableGraph<N,E> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractIncrementalDFABuilder<I> |
class |
IncrementalDFABuilder<I>
Incrementally builds an (acyclic) DFA, from a set of positive and negative words.
|
class |
IncrementalPCDFABuilder<I> |
Modifier and Type | Class and Description |
---|---|
class |
IncrementalMealyBuilder<I,O>
Incrementally builds an (acyclic) Mealy machine, from a set of input and corresponding
output words.
|
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 |
AutomatonAsGraph<S,I,T,A extends Automaton<S,I,T>> |
class |
UniversalAutomatonAsGraph<S,I,T,SP,TP,A extends UniversalAutomaton<S,I,T,SP,TP>> |
Modifier and Type | Method and Description |
---|---|
static <N,E> Mapping<N,Collection<E>> |
Graphs.incomingEdges(Graph<N,E> graph) |
Constructor and Description |
---|
OutEdgesMapping(Graph<N,E> graph) |
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> void |
GraphDOT.write(Graph<N,E> graph,
Appendable a,
GraphDOTHelper<N,? super E>... additionalHelpers)
Renders a
Graph in the GraphVIZ DOT format. |
static <N,E> void |
GraphDOT.write(Graph<N,E> graph,
Appendable a,
List<GraphDOTHelper<N,? super E>> helpers) |
static <N,E> void |
GraphDOT.write(Graph<N,E> graph,
GraphDOTHelper<N,? super E> dotHelper,
Appendable a)
Renders a
Graph in the GraphVIZ DOT format. |
static <N,E> void |
GraphDOT.write(Graph<N,E> graph,
GraphDOTHelper<N,? super E> helper,
Appendable a,
GraphDOTHelper<N,? super E>... additionalHelpers) |
static <N,E> void |
GraphDOT.writeToFile(Graph<N,E> graph,
GraphDOTHelper<N,E> dotHelper,
File file) |
Modifier and Type | Class and Description |
---|---|
class |
SharedSuffixTrie<I> |
class |
SuffixTrie<I> |
Copyright © 2015. All Rights Reserved.