Package de.uni_due.inf.ti.raven.data

Classes to create, represent, manipulate data.

See: Description

Interface Summary

Interface	Description
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.
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<T>	The Decomposition interface is the root interface in the decomposition hierarchy.
GraphDecomposition	The GraphDecomposition is the parent interface of the PathDecomposition and the TreeDecomposition interface.
RepositoryListener	The listener interface for receiving repository events.

Class Summary

Class	Description
Cospan	This class implements a cospan (of graphs), i.e. a pair of two (graph) morphisms with the same co-domain.
CospanCounterExample	A wrapper class for cospan decompositions that are used to give one graph as a counter-example for an algorithm
CospanDecomposition	This class implements a sequence of composable cospans.
Edge	This class represents a single (hyper-)edge of some graph.
Graph	This class represents an edge-labeled hypergraph, i.e. a 4-tuple G = (VG, EG, attG, labG) such that VG is a finite set of nodes, EG is a finite set of (hyper-)edges, attG is the attachment function, which assigns to each edge e a sequence of incident nodes attG(e) and labG is the labeling function, which assigns to each edge e label labG(e).
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.
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 CONNECT-Operation 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 FUSE-Operation which is used to fuse the last two nodes in the interface of some graph (cospan).
Operation.Perm	This class implements the PERM-Operation which is used to cyclic shift the nodes in the interface of some graph (cospan).
Operation.Res	This class implements the RES-Operation which is used to restrict the last node in the interface of some graph (cospan).
Operation.Trans	This class implements the TRANS-Operation which is used to transpose the first two nodes in the interface of some graph (cospan).
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).
PathDecomposition	A Path Decomposition of some graph G is a pair 𝒫 = (P,X) where P is a path and X is a family of sets of nodes (of the graph G) which are indexed by (path) nodes of P, such that the following conditions are satisfied: for each (graph) node v ∈ G, there exists a node p of P such that v ∈ Xp for each (graph) edge e ∈ G, there is a node p of P such that all nodes v attached to e are in Xp for each node v ∈ G, the graph induced by the nodes {p ∣ v ∈ Xp} is a subpath of P.
Permutation	This class implements a permutation on a set of nodes.
Repository	This class implements an in-memory database which is used to store the Data objects available in Raven.
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
Signature	This class implements a signature which is used to define the alphabet of an automaton.
TreeDecomposition	A Tree Decomposition of some graph G is a pair 𝒯 = (T,X) where T is a tree and X is a family of sets of nodes (of the graph G) which are indexed by (tree) nodes of T, such that the following conditions are satisfied: for each (graph) node v ∈ G, there exists a node t of T such that v ∈ Xt for each (graph) edge e ∈ G, there is a node t of T such that all nodes v attached to e are in Xt for each node v ∈ G, the graph induced by the nodes {t ∣ v ∈ Xt} is a subtree of T.

Enum Summary

Enum	Description
Cospan.Type	Enumeration of the different types of implemented cospans.
CounterExample.Type	Enumeration of the different types of implemented counter examples.
Decomposition.Type	Enumeration of the different types of implemented decompositions.
Edge.Type	Enumeration of the different types of implemented edges.
Graph.Type	Enumeration of the different types of implemented graphs.
Node.Type	Enumeration of the different types of implemented nodes.
Operation.Type	Enumeration of the different types of implemented operations.
Signature.Type	Enumeration of the different types of implemented signatures.

Package de.uni_due.inf.ti.raven.data Description

Classes to create, represent, manipulate data.