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
|
/**
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux 1 and Inria Bordeaux - Sud Ouest
*
* 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"
DOUBLEPLUGINOFGROUP(DepthMetric,"Depth","David Auber","15/02/2001","Alpha","1.0","Tree");
using namespace std;
using namespace tlp;
DepthMetric::DepthMetric(const tlp::PropertyContext &context):DoubleAlgorithm(context) {}
// structure below is used to implement dfs loop
struct dfsDepthStruct {
node current;
Iterator<node>* outNodes;
double maxDepth;
dfsDepthStruct() {}
dfsDepthStruct(node n, Iterator<node>* nodes):
current(n), outNodes(nodes), maxDepth(0.0) {}
};
//=================================================
// original recursive algorithm
/*double DepthMetric::getNodeValue(const tlp::node n) {
if (graph->outdeg(n)==0) return 0.0;
if (doubleResult->getNodeValue(n) > 0.1)
return doubleResult->getNodeValue(n);
double max = 0;
node _n2;
forEach(_n2, graph->getOutNodes(n))
max = std::max(max, getNodeValue(_n2));
doubleResult->setNodeValue(n, max + 1);
return max + 1;
} */
//=================================================
double DepthMetric::getNodeValue(tlp::node current) {
if (graph->outdeg(current) == 0) return 0.0;
double value = doubleResult->getNodeValue(current);
if (value > 0.1)
return value;
// dfs loop
stack<dfsDepthStruct> dfsLevels;
Iterator<node>* outNodes = graph->getOutNodes(current);
dfsDepthStruct dfsParams(current, outNodes);
double maxDepth = 0;
dfsLevels.push(dfsParams);
while(!dfsLevels.empty()) {
while (outNodes->hasNext()) {
node neighbour = outNodes->next();
value = doubleResult->getNodeValue(neighbour);
// compute max
if (value > 0.1)
maxDepth = std::max(maxDepth, value);
else {
outNodes = graph->getOutNodes(neighbour);
if (outNodes->hasNext()) {
// store maxDepth for current
dfsLevels.top().maxDepth = maxDepth;
// push new dfsParams on stack
current = dfsParams.current = neighbour;
dfsParams.outNodes = outNodes;
maxDepth = dfsParams.maxDepth = 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;
// save current maxDepth
++maxDepth;
doubleResult->setNodeValue(current, maxDepth);
// unstack current dfsParams
delete dfsLevels.top().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 maxDepth if any
dfsParams.maxDepth = std::max(dfsParams.maxDepth, maxDepth);
maxDepth = dfsParams.maxDepth;
}
return maxDepth;
}
//====================================================================
bool DepthMetric::run() {
doubleResult->setAllEdgeValue(0);
doubleResult->setAllNodeValue(0);
node _n;
forEach(_n, graph->getNodes())
doubleResult->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;
}
}
//=================================================
|
