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.
*
*/
#include "DagLevelMetric.h"
PLUGIN(DagLevelMetric)
using namespace std;
using namespace tlp;
DagLevelMetric::DagLevelMetric(const tlp::PluginContext* context):DoubleAlgorithm(context) {}
DagLevelMetric::~DagLevelMetric() {}
//======================================================
bool DagLevelMetric::run() {
MutableContainer<unsigned int> level;
dagLevel(graph, level, pluginProgress);
node n;
forEach(n, graph->getNodes())
result->setNodeValue(n, level.get(n.id));
return true;
}
//======================================================
bool DagLevelMetric::check(std::string &erreurMsg) {
if (AcyclicTest::isAcyclic(graph)) {
erreurMsg="";
return true;
}
else {
erreurMsg="The graph must be a acylic.";
return false;
}
}
|
