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
|
// Ceres Solver - A fast non-linear least squares minimizer
// Copyright 2013 Google Inc. All rights reserved.
// http://code.google.com/p/ceres-solver/
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
// * Neither the name of Google Inc. nor the names of its contributors may be
// used to endorse or promote products derived from this software without
// specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
//
// Author: Sameer Agarwal (sameeragarwal@google.com)
// This include must come before any #ifndef check on Ceres compile options.
#include "ceres/internal/port.h"
#ifndef CERES_NO_SUITESPARSE
#include "ceres/single_linkage_clustering.h"
#include "ceres/collections_port.h"
#include "ceres/graph.h"
#include "gtest/gtest.h"
namespace ceres {
namespace internal {
TEST(SingleLinkageClustering, GraphHasTwoComponents) {
Graph<int> graph;
const int kNumVertices = 6;
for (int i = 0; i < kNumVertices; ++i) {
graph.AddVertex(i);
}
// Graph structure:
//
// 0-1-2-3 4-5
graph.AddEdge(0, 1, 1.0);
graph.AddEdge(1, 2, 1.0);
graph.AddEdge(2, 3, 1.0);
graph.AddEdge(4, 5, 1.0);
SingleLinkageClusteringOptions options;
HashMap<int, int> membership;
ComputeSingleLinkageClustering(options, graph, &membership);
EXPECT_EQ(membership.size(), kNumVertices);
EXPECT_EQ(membership[1], membership[0]);
EXPECT_EQ(membership[2], membership[0]);
EXPECT_EQ(membership[3], membership[0]);
EXPECT_NE(membership[4], membership[0]);
EXPECT_NE(membership[5], membership[0]);
EXPECT_EQ(membership[4], membership[5]);
}
TEST(SingleLinkageClustering, ComponentWithWeakLink) {
Graph<int> graph;
const int kNumVertices = 6;
for (int i = 0; i < kNumVertices; ++i) {
graph.AddVertex(i);
}
// Graph structure:
//
// 0-1-2-3 4-5
graph.AddEdge(0, 1, 1.0);
graph.AddEdge(1, 2, 1.0);
graph.AddEdge(2, 3, 1.0);
// This component should break up into two.
graph.AddEdge(4, 5, 0.5);
SingleLinkageClusteringOptions options;
HashMap<int, int> membership;
ComputeSingleLinkageClustering(options, graph, &membership);
EXPECT_EQ(membership.size(), kNumVertices);
EXPECT_EQ(membership[1], membership[0]);
EXPECT_EQ(membership[2], membership[0]);
EXPECT_EQ(membership[3], membership[0]);
EXPECT_NE(membership[4], membership[0]);
EXPECT_NE(membership[5], membership[0]);
EXPECT_NE(membership[4], membership[5]);
}
TEST(SingleLinkageClustering, ComponentWithWeakLinkAndStrongLink) {
Graph<int> graph;
const int kNumVertices = 6;
for (int i = 0; i < kNumVertices; ++i) {
graph.AddVertex(i);
}
// Graph structure:
//
// 0-1-2-3 4-5
graph.AddEdge(0, 1, 1.0);
graph.AddEdge(1, 2, 1.0);
graph.AddEdge(2, 3, 0.5); // Weak link
graph.AddEdge(0, 3, 1.0);
// This component should break up into two.
graph.AddEdge(4, 5, 1.0);
SingleLinkageClusteringOptions options;
HashMap<int, int> membership;
ComputeSingleLinkageClustering(options, graph, &membership);
EXPECT_EQ(membership.size(), kNumVertices);
EXPECT_EQ(membership[1], membership[0]);
EXPECT_EQ(membership[2], membership[0]);
EXPECT_EQ(membership[3], membership[0]);
EXPECT_EQ(membership[4], membership[5]);
}
} // namespace internal
} // namespace ceres
#endif // CERES_NO_SUITESPARSE
|
