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
|
/**
*
* This file is part of Tulip (https://tulip.labri.fr)
*
* 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 "Kruskal.h"
#include <tulip/GraphTools.h>
#include <tulip/ConnectedTest.h>
#include <tulip/DoubleProperty.h>
PLUGIN(Kruskal)
using namespace std;
using namespace tlp;
static const char *paramHelp[] = {
// edge weight
"Metric containing the edge weights."};
//======================================================
Kruskal::Kruskal(const tlp::PluginContext *context) : BooleanAlgorithm(context) {
addInParameter<NumericProperty *>("edge weight", paramHelp[0], "viewMetric");
addOutParameter<unsigned int>("#edges selected", "The number of newly selected edges");
}
//======================================================
bool Kruskal::check(std::string &erreurMsg) {
if (!ConnectedTest::isConnected(graph)) {
erreurMsg = "The graph must be connected.";
return false;
}
return true;
}
//======================================================
/// Compute the Minimum Spanning Tree
bool Kruskal::run() {
/* Initialisation */
NumericProperty *edgeWeight = nullptr;
if (dataSet != nullptr) {
dataSet->get("edge weight", edgeWeight);
}
if (edgeWeight == nullptr)
edgeWeight = graph->getProperty<DoubleProperty>("viewMetric");
selectMinimumSpanningTree(graph, result, edgeWeight, pluginProgress);
// output some useful information
if (dataSet != nullptr) {
dataSet->set("#edges selected", result->numberOfNonDefaultValuatedEdges());
}
return true;
}
//=======================================================================
|
