Tulip  5.2.1
Large graphs analysis and drawing
GraphTest.h
1 /*
2  *
3  * This file is part of Tulip (http://tulip.labri.fr)
4  *
5  * Authors: David Auber and the Tulip development Team
6  * from LaBRI, University of Bordeaux
7  *
8  * Tulip is free software; you can redistribute it and/or modify
9  * it under the terms of the GNU Lesser General Public License
10  * as published by the Free Software Foundation, either version 3
11  * of the License, or (at your option) any later version.
12  *
13  * Tulip is distributed in the hope that it will be useful,
14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
16  * See the GNU General Public License for more details.
17  *
18  */
19 ///@cond DOXYGEN_HIDDEN
20 
21 #ifndef _GRAPHTEST_H
22 #define _GRAPHTEST_H
23 
24 #include <tulip/Algorithm.h>
25 
26 namespace tlp {
27 class GraphTest : public tlp::Algorithm {
28 public:
29  GraphTest(const tlp::PluginContext *context) : Algorithm(context) {
30  addOutParameter<bool>("result", "Whether the test succeeded or not.");
31  }
32 
33  bool run() override {
34  bool result = test();
35 
36  if (dataSet) {
37  dataSet->set("result", result);
38  }
39 
40  return true;
41  }
42 
43  virtual bool test() = 0;
44 };
45 } // namespace tlp
46 #endif //_GRAPHTEST_H
47 ///@endcond
This abstract class describes a basic algorithm plugin.
Definition: Algorithm.h:46
Contains runtime parameters for a plugin.
Definition: PluginContext.h:42