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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
|
/**
*
* 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 <stack>
#include "PathLengthMetric.h"
PLUGIN(PathLengthMetric)
using namespace std;
using namespace tlp;
//=======================================
PathLengthMetric::PathLengthMetric(const tlp::PluginContext* context):DoubleAlgorithm(context) {
// Leaf metric needed
addDependency("Leaf", "1.0");
}
// structure below is used to implement dfs loop
struct dfsStruct {
node current;
Iterator<node>* outNodes;
double res;
dfsStruct(node n, Iterator<node>* nodes):
current(n), outNodes(nodes), res(0.0) {}
};
//=======================================
// original recursive algorithm
/*double PathLengthMetric::getNodeValue(const tlp::node n) {
if (graph->outdeg(n)==0) return 0.0;
if (result->getNodeValue(n) > 0.1)
return result->getNodeValue(n);
double res=0;
node child;
forEach(child, graph->getOutNodes(n)) {
res += getNodeValue(child);
}
res += leafMetric->getNodeValue(n);
result->setNodeValue(n, res);
return res;
}*/
//=======================================================================
double PathLengthMetric::getNodeValue(tlp::node current,
tlp::DoubleProperty* leafMetric) {
if (graph->outdeg(current) == 0) return 0.0;
double value = result->getNodeValue(current);
if (value > 0.1)
return value;
// dfs loop
stack<dfsStruct> dfsLevels;
Iterator<node>* outNodes = graph->getOutNodes(current);
dfsStruct dfsParams(current, outNodes);
double res = 0.0;
dfsLevels.push(dfsParams);
while(!dfsLevels.empty()) {
while (outNodes->hasNext()) {
node neighbour = outNodes->next();
value = result->getNodeValue(neighbour);
// compute result
if (value > 0.1)
res += value;
else {
outNodes = graph->getOutNodes(neighbour);
if (outNodes->hasNext()) {
// store result for current
dfsLevels.top().res = res;
// push new dfsParams on stack
current = dfsParams.current = neighbour;
dfsParams.outNodes = outNodes;
res = dfsParams.res = 0.0;
dfsLevels.push(dfsParams);
// and go deeper
break;
}
else {
delete outNodes;
outNodes = dfsParams.outNodes;
}
}
}
if (outNodes->hasNext())
// new dfsParams has been pushed on stack
continue;
res += leafMetric->getNodeValue(current);
// save current result
result->setNodeValue(current, res);
// unstack current dfsParams
delete outNodes;
dfsLevels.pop();
if (dfsLevels.empty())
break;
// get dfsParams on top of dfsLevels
dfsParams = dfsLevels.top();
current = dfsParams.current;
outNodes = dfsParams.outNodes;
// update new current result if any
dfsParams.res += res;
res = dfsParams.res;
}
return res;
}
//=======================================
bool PathLengthMetric::run() {
result->setAllNodeValue(0);
result->setAllEdgeValue(0);
DoubleProperty leafMetric(graph);
string errorMsg;
if (!graph->applyPropertyAlgorithm("Leaf", &leafMetric, errorMsg)) {
tlp::warning() << errorMsg << endl;
return false;
}
node _n;
forEach(_n, graph->getNodes())
getNodeValue(_n, &leafMetric);
return true;
}
//=======================================
bool PathLengthMetric::check(std::string &erreurMsg) {
if (AcyclicTest::isAcyclic(graph))
return true;
else {
erreurMsg="The graph must be acyclic.";
return false;
}
}
//=======================================
|
