Package de.uni_due.inf.ti.raven.encodings

Classes to encode the state space and the transitions of the various graph automata.

See: Description

Class Summary

Class	Description
AnotherDominatingSetEncoding	This class provides a concrete implementation of an encoding for dominating set automata.
AnotherLinkEncoding	This class represents the new default encoding of state space and the transition functions of link automata and provides methods to access the encoding.
AnotherPathEncoding	This class provides a concrete implementation of an encoding for path automata.
BDDEncoding	This class represents the encoding of state space and the transition functions of some automaton.
BoundEncoding	This class represents the encoding of state space and the transition functions of minimum/maximum vertex/edge automata and provides methods to access the encoding.
ColorabilityEncoding	This class represents the encoding of state space and the transition functions of colorability automata and provides methods to access the encoding.
CountingEncoding	This class represents the encoding of state space and the transition functions of (edge- or vertex-)counting automata and provides methods to access the encoding.
DefaultColorabilityEncoding	This class provides a concrete implementation of an encoding for colorability automata.
DefaultDominatingSetEncoding	This class provides a concrete implementation of an encoding for dominating set automata.
DefaultEdgeCountingEncoding	This class provides a concrete implementation of an encoding for a edge-counting automaton.
DefaultLinkEncoding	This class represents the default encoding of state space and the transition functions of link automata and provides methods to access the encoding.
DefaultMaximumBoundEncoding	This class provides a concrete implementation of an encoding for a maximum edge automaton or maximum vertex automaton respectively.
DefaultMinimumBoundEncoding	This class provides a concrete implementation of an encoding for a minimum edge automaton or minimum vertex automaton respectively.
DefaultNoIsolatedNodesEncoding	This class provides a concrete implementation of an encoding for a no isolated nodes automaton.
DefaultPathEncoding	This class provides a concrete implementation of an encoding for path automata.
DefaultSubgraphEncoding	This class provides a concrete implementation of an encoding for subgraph automata.
DefaultVertexCountingEncoding	This class provides a concrete implementation of an encoding for a vertex-counting automaton.
DefaultVertexCoverEncoding	This class provides a concrete implementation of an encoding for vertex cover automata.
DominatingSetEncoding	This class represents the encoding of state space and the transition functions of dominating set automata and provides methods to access the encoding.
EdgeCountingEncoding	This class represents the encoding of state space and the transition functions of edge-counting automata and provides methods to access the encoding.
LinkEncoding	This class represents the encoding of state space and the transition functions of link automata and provides methods to access the encoding.
NoIsolatedNodesEncoding	This class represents the encoding of state space and the transition functions of no isolated nodes automata and provides methods to access the encoding.
PathEncoding	This class represents the encoding of state space and the transition functions of path automata and provides methods to access the encoding.
ProductEncoding	This class provides a concrete implementation of an encoding for intersection automata.
SubgraphEncoding	This class represents the encoding of state space and the transition functions of subgraph automata and provides methods to access the encoding.
UnionEncoding	This class provides a concrete implementation of an encoding for union automata.
VertexCountingEncoding	This class represents the encoding of state space and the transition functions of vertex-counting automata and provides methods to access the encoding.
VertexCoverEncoding	This class represents the encoding of state space and the transition functions of vertex cover automata and provides methods to access the encoding.

Enum Summary

Enum	Description
BDDEncoding.StateType	Enumeration of state types to distinguish between bits used for different states (e.g. in relations on the state set)
BoundEncoding.Type	Enumeration of the different types of bound encodings.

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

Classes to encode the state space and the transitions of the various graph automata. The classes in this package are used to abstract from the concrete implementation of the BDD encoding. Instead an interface for each automaton type (i.e. colorability, dominating set, ...) is provided which offers uniform methods to access the encoding information which is implemented by the different concrete encodings.