Searched refs:kVertexIds (Results 1 - 1 of 1) sorted by relevance

/external/ceres-solver/internal/ceres/
H A Dcanonical_views_clustering_test.cc43 const int kVertexIds[] = {0, 1, 2, 3}; member in namespace:ceres::internal
67 graph_.AddEdge(kVertexIds[i], kVertexIds[i + 1], kEdgeWeights[i]);
91 EXPECT_EQ(centers_[0], kVertexIds[1]);
92 EXPECT_EQ(centers_[1], kVertexIds[3]);
95 EXPECT_EQ(FindOrDie(membership_, kVertexIds[0]), 0);
96 EXPECT_EQ(FindOrDie(membership_, kVertexIds[1]), 0);
97 EXPECT_EQ(FindOrDie(membership_, kVertexIds[2]), 0);
98 EXPECT_EQ(FindOrDie(membership_, kVertexIds[3]), 1);
112 EXPECT_EQ(centers_[0], kVertexIds[
[all...]

Completed in 487 milliseconds