 BackwardAnalysis | This class performs a backward search to solve the coverability problem with respect to a given Order |
 BackwardResultHandler | The BackwardResultHandler is an interface to handle intermediate results produced by the backward search |
  InstantWriterResultHandler | The InstantWriterResultHandler implements the BackwardResultHandler by writing the given information as soon as possible to the filesystem |
 CollectionCallback< E > | This template provides a possibility to add elements to a collection without having a reference to the collection of knowing its type |
  VectorCallback< E > | This template class implements a CollectionCallback to a vector |
 CollectionCallback< graphs::Rule_sp > | |
  PreparedGTS::StdRuleMapCB | The StdRuleMapCB is a helper class defining a CollectionCallback to a PreparedGTS standard rule map |
 DelayedLogMessage | This class stores a log message and sends it at the end of the scope in which it was defined |
 Edge | This class represents an edge in a Hypergraph |
 ErrorHandler | |
  XercesLoggingErrorHandler | Prints errors generated by the Xerces framework |
 exception | |
  GenericMessageException | This class serves as a superclass of all Exceptions |
   InitialisationException | This exception is thrown if an object could not be initialized successfully |
   InvalidInputException | This exception is thrown whenever a function is called with invalid inputs |
   InvalidStateException | This exception is thrown if a function of an object was called, but the object was not in a valid state to call this function |
   OutOfIDsException | This exception is thrown if an object was about to be created, but the programm has run out of unique IDs |
   RunException | This exception is thrown if an algorithm or Scenario was executed, but encountered and error |
   XMLioException | This exception is thrown if an error occurred while importing or exporting XML documents |
 ExpEnumerator | This class represents a number over a variable base with a fixed length |
 GraphDrawer | This class provides static methods for Converting GXL files to the 'dot' format |
 GTXLReader | This class imports GXL or GTXL XML files and converts them to Hypergraph and GTS objects respectively |
  GTXLReaderXerces | This class imports GXL or GTXL XML files and converts them to Hypergraph and GTS objects respectively |
 GTXLWriter | This class exports GXL or GTXL XML files by converting them from Hypergraph and GTS objects respectively |
  GTXLWriterXerces | This class exports GXL or GTXL XML files by converting them from Hypergraph and GTS objects respectively |
 hash< unordered_set< T > > | Defines the hash of an unordered_set as the xor of all elements of the set |
 IDClosureEnumerator | This enumerator can be used to enumerate all equivalences on IDs, where the equivalence closure of the enumerated IDPartition and a predefined IDPartition is the IDPartition, where every ID is in the same partition |
 IDPartitionEnumerator | Provides a possibility to enumerate all partitions on a given set of IDs |
 IDPartitionPointerEquality | An equality checker for pointers to IDPartitions |
 IDPartitionPointerHasher | A hasher for pointers to IDPartions |
 IDtoIDEnumerator | This enumerator encapsulates a mapping of an ID to a set of IDs |
 IsomorphismChecker | Checks whether two given Hypergraphs are isomorphic or not |
 LatexExporter | Provides a possibility to generate Latex files from GTS objects or graph sets |
 Mapping | This is the data structure representing a morphism mapping from a graph to another graph |
 MessageLogger | This class is used to stream log messages |
 MinGraphList | This data structure stores a collection of graphs minimal to some given order |
 MinPOCEnumerator | This abstract class serves as a schema of an enumerator taking a rule and a graph and enumerating all minimal pushout complements wrt |
  MinorPOCEnumerator | Implements the abstract MinPOCEnumerator class for the minor ordering |
  SubgraphPOCEnumerator | This enumerator can be used to enumerate all pushout complements of a (partial) rule and a graph |
 Order | This class presents a generic ordering relation on Hypergraphs |
  MinorOrder | This class implements the Hypergraph Minor Ordering, as described in "Applying the Graph Minor
Theorem to the Verification of Graph Transformation Systems" (Salil Joshi, Barbara König) |
  OldMinorOrder | This class is an old implementation of the Hypergraph Minor Ordering based on searching for disjoint paths |
  SubgraphOrder | This class implement the "standard" subgraph ordering |
 ostream | |
  MultiStream | |
 PartialPOCEnumerator | The PartialPOCEnumerator computes a subset of all pushout complement of a partial rule and a total match |
 PathChecker | Functions to compute whether given graphs have paths of a defined length |
 OldMinorOrder::PathFinder | Searching for paths between two vertices |
 OldMinorOrder::PathFinder::QueueEl | |
 RulePreparer | This class takes a rule and prepares it such that no special case handling is necessary while performing the analysis |
  NoRulePreparer | This RulePreparer returns all rules unprepared |
  MinorRulePreparer | This class prepares given rules to be used together with the minor order in the backward search |
  SubgraphRulePreparer | This class prepares given rules to be used together with the subgraph order in the backward search |
 SafeXRes< T > | This template provides a container which automatically release a given Xerces resource, when the pointer runs out of scope |
 SafeXTString< T > | This template provides a container which automatically releases a transcoded string, when the pointer runs out of scope |
 Scenario | A scenario is a subprogram using a set of input parameters to execute some algorithms, producing desired output |
  BackwardAnalysisScenario | This Scenario performs a backward analysis according to the provided parameters |
  BackwardStepTest | This test scenario takes a given set of rules and a given set of error graphs and performs a single backward step, including rule preparation |
  GTXLtoLatexConverter | Use this Scenario to create a graphical representation of the given GTXL file |
  GXLtoPicConverter | This Scenario takes a GXL file and converts the encoded Hypergraphs first to a 'dot' file and then to the set file format using neato |
  LeaderElectionRuleCreater | When called this Scenario generates the GTS for the leader election example |
  LEQCheckScenario | This Scenario allows to check whether graphs of a given set are represented by another given, upward-closed set |
  MatcherScenario | This scenario takes two sets of graphs and computes all matching from one set to the other |
  RulePreparerTest | This scenario tests the rule preparation functionality |
  XMLTestScenario | This Scenario tests the GTXLReader and GTXLWriter classes on correctness |
 ScenarioLoader | This class generates Scenario object from their string identifier (without initializing them) |
 SignatureCreater | The SignatureCreater provides functions to generate signatures for Hypergraphs |
 StdMatchFinder | StdMatchFinder provides a simple algorithm which takes two arbitrary graphs and calculates all matchings from one to the other |
 Streamable | Streamable provides a streaming function which must be implemented by any deriving class |
  AnonHypergraph | An AnonHypergraph is a data structure storing a hypergraph |
   Hypergraph | A Hypergraph represents a graph with a unique identifier |
  AnonRule | AnonRule serves as a data structure of a rule object |
   Rule | Represents the data structure for a rule including a unique identifier |
   UQRuleInstance | The UQRuleInstance is a rule which is generated when UQRules are instantiated |
  GTS | Data structure for a graph transformation system |
   PreparedGTS | Graph transformation system that was prepared for use in the backward procedure |
  UQRule | This class serves as data structure of a universally quantified rule |
 streambuf | |
  MultiStreamBuffer | |
 TerminationMessage | Encapsulates a timer, which is started when the TerminationMessage is created |
 Timer | Provides a timer, which can be started and used to measure elapsed time |
 TotalPOCEnumerator | This enumerator computes all pushout complements for all co-matches from a total (given) rule to a given graph |
 OldMinorOrder::twoIDLists | |
 PreparedGTS::uqinst_iterator | The uqinst_iterator generates UQRuleInstances for backward application |
 Vertex | Vertex stores all data of a vertex in a Hypergraph |