Package  Description 

de.uni_due.inf.ti.raven.actions 
General Action Classes.

de.uni_due.inf.ti.raven.algorithms 
Classes to run different algorithms.

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.encodings 
Classes to encode the state space and the transitions of the various graph automata.

de.uni_due.inf.ti.raven.gui 
GUI Classes.

de.uni_due.inf.ti.raven.gui.automaton 
Classes which provide (visual) forms either used to collect information required to create the
several graph automata or used to present information about existing graph automata.

de.uni_due.inf.ti.raven.gui.graphs 
GUI Classes to visualize graphs.

de.uni_due.inf.ti.raven.io 
Classes to load, save and print data.

Class and Description 

Cospan
This class implements a

CospanCounterExample
A wrapper class for cospan decompositions that are used to give one
graph as a counterexample for an algorithm

CospanDecomposition
This class implements a sequence of composable cospans.

Data
A class implements the
Data interface to indicate that the instances
of the class provide basic data types of raven which can be stored in the repository. 
Graph
This class represents an edgelabeled

GraphDecomposition
The
GraphDecomposition is the parent interface of the
PathDecomposition and the TreeDecomposition interface. 
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.

Operation.Connect
This class implements the CONNECTOperation which is used to attach a new edge to the
last nodes in the interface of some graph (cospan).

RuleCounterExample
A wrapper class for cospan decompositions that are used to give two
graphs with the same context as a counterexample for an algorithm

Signature
This class implements a

TreeDecomposition
A

Class and Description 

Cospan
This class implements a

CospanCounterExample
A wrapper class for cospan decompositions that are used to give one
graph as a counterexample for an algorithm

CospanDecomposition
This class implements a sequence of composable cospans.

Graph
This class represents an edgelabeled

GraphDecomposition
The
GraphDecomposition is the parent interface of the
PathDecomposition and the TreeDecomposition interface. 
RuleCounterExample
A wrapper class for cospan decompositions that are used to give two
graphs with the same context as a counterexample for an algorithm

Class and Description 

Cospan.Type
Enumeration of the different types of implemented cospans.

CospanDecomposition
This class implements a sequence of composable cospans.

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. 
CounterExample.Type
Enumeration of the different types of implemented counter examples.

Data
A class implements the
Data interface to indicate that the instances
of the class provide basic data types of raven which can be stored in the repository. 
Data.Type
The
Type interface is implemented by each class implementing the
Data interface to indicate the possible manifestations (of the data class). 
Decomposition
The
Decomposition interface is the root interface in the decomposition hierarchy. 
Decomposition.Type
Enumeration of the different types of implemented decompositions.

Edge
This class represents a single (hyper)edge of some graph.

Edge.Type
Enumeration of the different types of implemented edges.

Graph
This class represents an edgelabeled

Graph.Type
Enumeration of the different types of implemented graphs.

GraphDecomposition
The
GraphDecomposition is the parent interface of the
PathDecomposition and the TreeDecomposition interface. 
GraphDecomposition.Bag
This class represents a set of nodes used by several types of graph
decompositions.

NameDataPair
This class is used to assign a name to some
data object. 
Node
This class represents a single node of some hypergraph.

Node.Type
Enumeration of the different types of implemented nodes.

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.

Operation.Comparator
This class imposes a total order on the set of (atomic cospan) operations.

Operation.Connect
This class implements the CONNECTOperation which is used to attach a new edge to the
last nodes in the interface of some graph (cospan).

Operation.Fuse
This class implements the FUSEOperation which is used to fuse the last two nodes in the
interface of some graph (cospan).

Operation.Perm
This class implements the PERMOperation which is used to cyclic shift the nodes in the
interface of some graph (cospan).

Operation.Res
This class implements the RESOperation which is used to restrict the last node in the
interface of some graph (cospan).

Operation.Trans
This class implements the TRANSOperation which is used to transpose the first two nodes in the
interface of some graph (cospan).

Operation.Type
Enumeration of the different types of implemented operations.

Operation.Vertex
This class implements the VERTEXOperation which is used to add a new node at the last
position of the interface of some graph (cospan).

PathDecomposition
A

Permutation
This class implements a permutation on a set of nodes.

Repository
This class implements an inmemory database which is used to store the
Data objects available in Raven. 
RepositoryListener
The listener interface for receiving repository events.

Signature
This class implements a

Signature.Type
Enumeration of the different types of implemented signatures.

TreeDecomposition
A

Class and Description 

CospanDecomposition
This class implements a sequence of composable cospans.

Data
A class implements the
Data interface to indicate that the instances
of the class provide basic data types of raven which can be stored in the repository. 
Data.Type
The
Type interface is implemented by each class implementing the
Data interface to indicate the possible manifestations (of the data class). 
Edge
This class represents a single (hyper)edge of some graph.

Graph
This class represents an edgelabeled

Node
This class represents a single node of some hypergraph.

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.

Operation.Connect
This class implements the CONNECTOperation which is used to attach a new edge to the
last nodes in the interface of some graph (cospan).

Signature
This class implements a

Class and Description 

Data
A class implements the
Data interface to indicate that the instances
of the class provide basic data types of raven which can be stored in the repository. 
Data.Type
The
Type interface is implemented by each class implementing the
Data interface to indicate the possible manifestations (of the data class). 
Class and Description 

Edge
This class represents a single (hyper)edge of some graph.

Graph
This class represents an edgelabeled

Node
This class represents a single node of some hypergraph.

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.

Class and Description 

Cospan
This class implements a

CospanDecomposition
This class implements a sequence of composable cospans.

Data
A class implements the
Data interface to indicate that the instances
of the class provide basic data types of raven which can be stored in the repository. 
Edge
This class represents a single (hyper)edge of some graph.

Graph
This class represents an edgelabeled

Node
This class represents a single node of some hypergraph.

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.

PathDecomposition
A

Repository
This class implements an inmemory database which is used to store the
Data objects available in Raven. 
RepositoryListener
The listener interface for receiving repository events.

Signature
This class implements a

TreeDecomposition
A

Class and Description 

CospanDecomposition
This class implements a sequence of composable cospans.

Class and Description 

Cospan
This class implements a

CospanDecomposition
This class implements a sequence of composable cospans.

Graph
This class represents an edgelabeled

GraphDecomposition
The
GraphDecomposition is the parent interface of the
PathDecomposition and the TreeDecomposition interface. 
Class and Description 

Cospan
This class implements a

CospanDecomposition
This class implements a sequence of composable cospans.

Graph
This class represents an edgelabeled

GraphDecomposition
The
GraphDecomposition is the parent interface of the
PathDecomposition and the TreeDecomposition interface. 
Signature
This class implements a
