Tulip  5.1.0
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 
22 #ifndef _GRAPHTEST_H
23 #define _GRAPHTEST_H
24 
25 #include <tulip/Algorithm.h>
26 
27 namespace tlp {
28 class GraphTest : public tlp::Algorithm {
29 public:
30  GraphTest(const tlp::PluginContext* context) : Algorithm(context) {
31  addOutParameter<bool>("result", "Whether the test succeeded or not.");
32  }
33 
34  virtual bool run() {
35  bool result = test();
36 
37  if (dataSet) {
38  dataSet->set("result",result);
39  }
40 
41  return true;
42  }
43 
44  virtual bool test()=0;
45 };
46 
47 }
48 #endif //_GRAPHTEST_H
49 ///@endcond
This abstract class describes a basic algorithm plugin.
Definition: Algorithm.h:45
Contains runtime parameters for a plugin.
Definition: PluginContext.h:39