1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
|
/**
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux
*
* Tulip is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* Tulip is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* See the GNU General Public License for more details.
*
*/
#ifndef Tulip_REACHABLESUBGRAPHELECTION_H
#define Tulip_REACHABLESUBGRAPHELECTION_H
#include <tulip/TulipPluginHeaders.h>
/** \addtogroup selection */
/**
* This selection plugin enables to find all nodes and edges at a fixed distance of a set of nodes.
* It takes three parameters :
* - <b>int</b> distance
* - <b>StringCollection</b> edge direction : output edges , input edges , all edges
* - <b>BooleanProperty *</b> startingnodes : the selected nodes of this BooleanProperty
* (those whose associated value is true) will be used as starting nodes.
*
* \author David Auber, LaBRI University Bordeaux I France:
* auber@tulip-software.org
*/
class ReachableSubGraphSelection:public tlp::BooleanAlgorithm {
public:
PLUGININFORMATION("Reachable Sub-Graph","David Auber","01/12/1999","Alpha","1.0", "Selection")
ReachableSubGraphSelection(const tlp::PluginContext* context);
~ReachableSubGraphSelection();
bool run();
};
#endif
|
