Package | Description |
---|---|
de.uni_due.inf.ti.raven.actions |
General Action Classes.
|
de.uni_due.inf.ti.raven.data |
Classes to create, represent, manipulate data.
|
de.uni_due.inf.ti.raven.data.automata |
Classes to create, represent, manipulate automata.
|
de.uni_due.inf.ti.raven.data.bdd |
Classes to create, represent and manipulate binary decision diagrams (BDDs).
|
de.uni_due.inf.ti.raven.gui |
GUI Classes.
|
Constructor and Description |
---|
AddToRepositoryAction(String name,
Data data)
Creates a new
Action to add a Data-object data with the name name to
the repository. |
Modifier and Type | Interface and Description |
---|---|
interface |
CounterExample
A class implements the
CounterExample interface to indicate that the instances
of the class provide the counter example types of raven which can be stored in the repository. |
interface |
Decomposition<T>
The
Decomposition interface is the root interface in the decomposition hierarchy. |
interface |
GraphDecomposition
The
GraphDecomposition is the parent interface of the
PathDecomposition and the TreeDecomposition interface. |
Modifier and Type | Class and Description |
---|---|
class |
Cospan
This class implements a
|
class |
CospanCounterExample
A wrapper class for cospan decompositions that are used to give one
graph as a counter-example for an algorithm
|
class |
CospanDecomposition
This class implements a sequence of composable cospans.
|
class |
Edge
This class represents a single (hyper-)edge of some graph.
|
class |
Graph
This class represents an edge-labeled
|
class |
Node
This class represents a single node of some hypergraph.
|
class |
Operation
This class is the abstract base class for the several operations which can be
used to create graphs and cospans by means of the composition of these
operations.
|
static class |
Operation.Connect
This class implements the CONNECT-Operation which is used to attach a new edge to the
last nodes in the interface of some graph (cospan).
|
static class |
Operation.Fuse
This class implements the FUSE-Operation which is used to fuse the last two nodes in the
interface of some graph (cospan).
|
static class |
Operation.Perm
This class implements the PERM-Operation which is used to cyclic shift the nodes in the
interface of some graph (cospan).
|
static class |
Operation.Res
This class implements the RES-Operation which is used to restrict the last node in the
interface of some graph (cospan).
|
static class |
Operation.Trans
This class implements the TRANS-Operation which is used to transpose the first two nodes in the
interface of some graph (cospan).
|
static class |
Operation.Vertex
This class implements the VERTEX-Operation which is used to add a new node at the last
position of the interface of some graph (cospan).
|
class |
PathDecomposition
A
|
class |
RuleCounterExample
A wrapper class for cospan decompositions that are used to give two
graphs with the same context as a counter-example for an algorithm
|
class |
Signature
This class implements a
|
class |
TreeDecomposition
A
|
Modifier and Type | Method and Description |
---|---|
Data |
Repository.get(String name)
Returns the object with the name
name . |
Data |
NameDataPair.getData()
Returns the
Data object |
Modifier and Type | Method and Description |
---|---|
boolean |
Repository.contains(Data data)
Returns
true if and only if the object data is
contained in this repository. |
void |
RepositoryListener.dataAdded(String name,
Data data)
Invoked when data is added to the repository.
|
void |
RepositoryListener.dataRemoved(String name,
Data data)
Invoked when data is removed from the repository.
|
String |
Repository.getName(Data item)
Returns the name of object
data . |
boolean |
Repository.put(String name,
Data item)
Adds a new object
item with the name name
to this repository. |
Constructor and Description |
---|
NameDataPair(String name,
Data data)
Creates a new
NameDataPair . |
Modifier and Type | Class and Description |
---|---|
class |
Automaton
This abstract class is the base class for all symbolic graph automata.
|
class |
ColorabilityAutomaton
This class implements a graph automaton accepting the language of all graphs which are
k-colorable.
|
class |
DominatingSetAutomaton
This class implements a graph automaton accepting the language of all graphs which have a
dominating set of size at most k, i.e. a set D of nodes with size at most k
such that each node of the graph is either in D or adjacent to a node in D.
|
class |
EdgeCountingAutomaton
This class implements a graph automaton accepting the language of all graphs whose number of
edges of a specific kind is equal to remainder modulo divisor.
|
class |
LinkAutomaton
This class implements a graph automaton accepting all graphs that have an
edge between a node from the inner to a node from the outer interface.
|
class |
MaximumEdgeAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of edges is at most maximum.
|
class |
MaximumVertexAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of nodes is at most maximum.
|
class |
MinimumEdgeAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of edges is at least minimum.
|
class |
MinimumVertexAutomaton
This class implements a graph automaton accepting the language of all graphs
whose number of nodes is at least minimum.
|
class |
NoIsolatedNodesAutomaton
This class implements a graph automaton accepting the language of all graphs which do not
contain any isolated node.
|
class |
PathAutomaton
This class implements a graph automaton accepting the language of all graphs
where certain nodes are connected by a path.
|
class |
ProductAutomaton
This class implements a graph automaton accepting the language which is obtained by the
intersection of the languages of the two underlying graph automata.
|
class |
SubgraphAutomaton
This class implements a graph automaton accepting the language of all graphs which contain a
specific graph as subgraph.
|
class |
UnionAutomaton
This class implements a graph automaton accepting the language which is obtained by the
union of the languages of the two underlying graph automata.
|
class |
VertexCountingAutomaton
This class implements a graph automaton accepting the language of all graphs whose number of
nodes is equal to remainder modulo divisor.
|
class |
VertexCoverAutomaton
This class implements a graph automaton accepting the language of all graphs which have a
vertex cover of size at most k, i.e. a set C of nodes with size at most k
such that each edge of the graph is incident to at least one node of C.
|
Modifier and Type | Class and Description |
---|---|
class |
RavenBDD
This class implements a BDD abstraction layer for the BDD implementation.
|
Modifier and Type | Class and Description |
---|---|
class |
InformationPanel<T extends Data>
This abstract class is the base class for panels which are used for displaying
information about the several
Data objects created by the user. |
class |
InformationPanelBuilder<T extends Data>
This class provides an abstract builder which is used to to create a general
purpose
InformationPanel . |
Modifier and Type | Method and Description |
---|---|
Data |
DataComboBox.getSelectedData()
Returns the selected
Data -object. |
Modifier and Type | Method and Description |
---|---|
void |
MainWindow.dataAdded(String name,
Data data) |
void |
DataComboBox.dataAdded(String name,
Data data) |
void |
MainWindow.dataRemoved(String name,
Data data) |
void |
DataComboBox.dataRemoved(String name,
Data data) |
Modifier and Type | Method and Description |
---|---|
void |
DataComboBox.addDataClass(Class<? extends Data> dataClass) |