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
49
50
51
52
53
54
55
56
57
58
|
/**
*
* This file is part of Tulip (https://tulip.labri.fr)
*
* 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 MAKESELECTIONGRAPH_H
#define MAKESELECTIONGRAPH_H
#include <tulip/BooleanProperty.h>
#include <tulip/GraphTest.h>
#include "../utils/PluginNames.h"
/** \addtogroup selection */
/**
* This selection plugin extends the current selection to a graph.
* All selected edges will also have their extremities selected (no dangling edges).
*
* \author Bruno Pinaud, LaBRI University of Bordeaux France:
*/
class MakeSelectionGraph : public tlp::BooleanAlgorithm {
public:
MakeSelectionGraph(const tlp::PluginContext *context);
PLUGININFORMATION(tlp::SelectionAlgorithm::MakeSelectionGraph, "Bruno Pinaud", "28/11/2016",
"Extends the selection to have a graph.<br/>"
"All selected edges of the current graph will have their extremities selected "
"(no dangling edges).",
"1.0", "Selection")
bool run() override;
};
class isGraphTest : public tlp::GraphTest {
PLUGININFORMATION("Graph", "Bruno Pinaud", "29/11/2016",
"Tests whether the set of the selected "
"elements of the current graph is a "
"graph or not (no dangling edges).",
"1.0", "Topological Test")
public:
isGraphTest(const tlp::PluginContext *context);
bool test() override;
};
#endif // MAKESELECTIONGRAPH_H
|
