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
|
/**
*
* 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 "ClusterMetric.h"
PLUGIN(ClusterMetric)
using namespace std;
using namespace tlp;
namespace {
const char * paramHelp[] = {
// property
HTML_HELP_OPEN() \
HTML_HELP_DEF( "type", "int" ) \
HTML_HELP_DEF( "values", "[1 , |G|]" ) \
HTML_HELP_DEF( "default", "1" ) \
HTML_HELP_BODY() \
"Maximal depth of a computed cluster." \
HTML_HELP_CLOSE()
};
}
//=================================================
ClusterMetric::ClusterMetric(const tlp::PluginContext* context):DoubleAlgorithm(context) {
addInParameter<unsigned int>("depth",paramHelp[0],"1");
}
//=================================================
static double clusterGetEdgeValue(Graph *graph,
MutableContainer<double>& clusters,
const edge e ) {
pair<node, node> eEnds = graph->ends(e);
const double& v1 = clusters.get(eEnds.first.id);
const double& v2 = clusters.get(eEnds.second.id);
if (v1*v1 + v2*v2 > 0)
return 1.- fabs(v1 - v2)/sqrt(v1*v1 + v2*v2);
return 0.;
}
//=================================================
bool ClusterMetric::run() {
// tlp::warning() << __PRETTY_FUNCTION__ << endl;
unsigned int maxDepth = 1;
if (dataSet!=NULL) dataSet->get("depth", maxDepth);
MutableContainer<double> clusters;
clusteringCoefficient(graph, clusters, maxDepth, pluginProgress);
node n;
forEach(n, graph->getNodes())
result->setNodeValue(n, clusters.get(n.id));
edge e;
forEach(e, graph->getEdges())
result->setEdgeValue(e, clusterGetEdgeValue(graph, clusters, e));
return true;
}
|
