20 #ifndef LEQCHECKSCENARIO_H_
21 #define LEQCHECKSCENARIO_H_
23 #include "../basic_types/Scenario.h"
24 #include "../graphs/Hypergraph.h"
25 #include "../basic_types/Order.h"
56 virtual void run()
override;
59 virtual void initialize(unordered_map<string,string>& parameters)
override;
shared_ptr< vector< graphs::Hypergraph_sp > > checkGraphs
Stores the set of graphs for which it will be checked if they are represented by a graph of minimalGr...
Definition: LEQCheckScenario.h:81
LEQCheckScenario()
Creates a new LEQCheckScenario without initializing it.
Definition: LEQCheckScenario.cpp:39
virtual void run() override
Executes the scenario.
Definition: LEQCheckScenario.cpp:119
shared_ptr< vector< graphs::Hypergraph_sp > > minimalGraphs
Stores the set of minimal graphs of an upward closed set.
Definition: LEQCheckScenario.h:76
bool faststop
Stores whether this Scenario should terminate after the first related pair of graphs was found...
Definition: LEQCheckScenario.h:66
basic_types::Order * order
Stores the Order used by this Scenario.
Definition: LEQCheckScenario.h:71
virtual void initialize(unordered_map< string, string > ¶meters) override
Initializes the scenario with the given mapping, where the keys are parameter names.
Definition: LEQCheckScenario.cpp:69
This Scenario allows to check whether graphs of a given set are represented by another given...
Definition: LEQCheckScenario.h:41
A scenario is a subprogram using a set of input parameters to execute some algorithms, producing desired output.
Definition: Scenario.h:36
This class presents a generic ordering relation on Hypergraphs.
Definition: Order.h:32
virtual ~LEQCheckScenario()
Destroys this instance of LEQCheckScenario.
Definition: LEQCheckScenario.cpp:65