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
155
156
157
|
/**
*
* 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 "DepthMetric.h"
PLUGIN(DepthMetric)
using namespace std;
using namespace tlp;
static const char * paramHelp[] = {
HTML_HELP_OPEN() \
HTML_HELP_DEF( "type", "NumericProperty" ) \
HTML_HELP_DEF( "default", "None" ) \
HTML_HELP_BODY() \
"This parameter defines the metric used for edges weight." \
HTML_HELP_CLOSE(),
};
DepthMetric::DepthMetric(const tlp::PluginContext* context):DoubleAlgorithm(context), edgeWeight(NULL) {
addInParameter<NumericProperty*> ("edge weight", paramHelp[0], "", false);
}
// structure below is used to implement dfs loop
struct dfsDepthStruct {
node current;
Iterator<edge>* outEdges;
double maxDepth;
double edgeValue;
dfsDepthStruct(): outEdges(NULL), maxDepth(0.0), edgeValue(0.0) {}
dfsDepthStruct(node n, Iterator<edge>* edges):
current(n), outEdges(edges), maxDepth(0.0), edgeValue(0.0) {}
};
//=================================================
double DepthMetric::getNodeValue(tlp::node current) {
if (graph->outdeg(current) == 0) return 0.0;
double value = result->getNodeValue(current);
if (value > 0.0)
return value;
// dfs loop
stack<dfsDepthStruct> dfsLevels;
Iterator<edge>* outEdges = graph->getOutEdges(current);
dfsDepthStruct dfsParams(current, outEdges);
double maxDepth = 0.0;
dfsLevels.push(dfsParams);
while(!dfsLevels.empty()) {
while(outEdges->hasNext()) {
edge e = outEdges->next();
double edgeValue = edgeWeight ? edgeWeight->getEdgeDoubleValue(e) : 1.0;
node neighbour = graph->target(e);
value = result->getNodeValue(neighbour);
// compute max
if (value > 0.0)
// since depth value of neighbour is already computed
// update maxDepth if needed
maxDepth = std::max(maxDepth, value + edgeValue);
else {
// we need to compute depth value for neighbour
outEdges = graph->getOutEdges(neighbour);
if (outEdges->hasNext()) {
// store maxDepth for current
dfsLevels.top().maxDepth = maxDepth;
// store edgeValue for current
// it will be needed as soon as the value
// for neighbour will be computed
dfsLevels.top().edgeValue = edgeValue;
// push neighbour dfsParams on stack
current = dfsParams.current = neighbour;
dfsParams.outEdges = outEdges;
maxDepth = dfsParams.maxDepth = dfsParams.edgeValue = 0.0;
dfsLevels.push(dfsParams);
// and go deeper
break;
}
else { // no out edges for neighbour
// so its depth value will remain to 0.0
delete outEdges;
// go on with the current
outEdges = dfsParams.outEdges;
// update current maxDepth if needed
maxDepth = std::max(maxDepth, edgeValue);
}
}
}
if (outEdges->hasNext())
// new dfsParams has been pushed on stack
continue;
// save current maxDepth
result->setNodeValue(current, maxDepth);
// unstack current dfsParams
delete dfsLevels.top().outEdges;
dfsLevels.pop();
if (dfsLevels.empty())
break;
// get dfsParams on top of dfsLevels
dfsParams = dfsLevels.top();
current = dfsParams.current;
outEdges = dfsParams.outEdges;
// update current maxDepth
dfsParams.maxDepth = std::max(dfsParams.maxDepth,
maxDepth + dfsParams.edgeValue);
maxDepth = dfsParams.maxDepth;
}
return maxDepth;
}
//====================================================================
bool DepthMetric::run() {
if ( dataSet!=NULL) {
dataSet->get("edge weight", edgeWeight);
}
result->setAllEdgeValue(0);
result->setAllNodeValue(0);
node _n;
forEach(_n, graph->getNodes()) {
result->setNodeValue(_n, getNodeValue(_n));
}
return true;
}
//=================================================
bool DepthMetric::check(std::string &erreurMsg) {
if (AcyclicTest::isAcyclic(graph))
return true;
else {
erreurMsg="The graph must be acyclic.";
return false;
}
}
//=================================================
|
