Searched refs:kVertexIds (Results 1 – 1 of 1) sorted by relevance
| /external/ceres-solver/internal/ceres/ |
| D | canonical_views_clustering_test.cc | 46 const int kVertexIds[] = {0, 1, 2, 3}; variable
70 graph_.AddEdge(kVertexIds[i], kVertexIds[i + 1], kEdgeWeights[i]); in SetUp()
94 EXPECT_EQ(centers_[0], kVertexIds[1]); in TEST_F()
95 EXPECT_EQ(centers_[1], kVertexIds[3]); in TEST_F()
98 EXPECT_EQ(FindOrDie(membership_, kVertexIds[0]), 0); in TEST_F()
99 EXPECT_EQ(FindOrDie(membership_, kVertexIds[1]), 0); in TEST_F()
100 EXPECT_EQ(FindOrDie(membership_, kVertexIds[2]), 0); in TEST_F()
101 EXPECT_EQ(FindOrDie(membership_, kVertexIds[3]), 1); in TEST_F()
115 EXPECT_EQ(centers_[0], kVertexIds[1]); in TEST_F()
129 EXPECT_EQ(centers_[0], kVertexIds[1]); in TEST_F()
[all …]
|