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
|
/**
*
* 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.
*
*/
#include "LoopSelection.h"
PLUGIN(LoopSelection)
using namespace std;
using namespace tlp;
LoopSelection::LoopSelection(const tlp::PluginContext* context):BooleanAlgorithm(context) {}
//============================================
bool LoopSelection::run() {
result->setAllNodeValue(false);
edge e;
forEach(e, graph->getEdges()) {
const std::pair<node, node>& eEnds = graph->ends(e);
result->setEdgeValue(e, eEnds.first == eEnds.second);
}
return true;
}
//============================================
|
