saberbud/ceres-solver
1
0
Fork 0
mirror of https://github.com/ceres-solver/ceres-solver.git synced 2026-08-30 00:50:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

Removing using std::...

Browse Source 
Change-Id: I584402e2a34869183c1d59071a15d97b216c52fb
This commit is contained in:
Alexander Ivanov
2023-01-11 16:51:38 +00:00
parent e1ca3302af
commit 53df5ddcfd
47 changed files with 479 additions and 608 deletions
Download Patch File Download Diff File Expand all files Collapse all files
internal/ceres/graph_algorithms_test.cc
+4 -6
View File
@@ -40,8 +40,6 @@
namespace ceres::internal {
using std::vector;
TEST(IndependentSetOrdering, Chain) {
Graph<int> graph;
graph.AddVertex(0);
@@ -57,7 +55,7 @@ TEST(IndependentSetOrdering, Chain) {
// 0-1-2-3-4
// 0, 2, 4 should be in the independent set.
vector<int> ordering;
std::vector<int> ordering;
int independent_set_size = IndependentSetOrdering(graph, &ordering);
sort(ordering.begin(), ordering.begin() + 3);
@@ -91,7 +89,7 @@ TEST(IndependentSetOrdering, Star) {
// |
// 3
// 1, 2, 3, 4 should be in the independent set.
vector<int> ordering;
std::vector<int> ordering;
int independent_set_size = IndependentSetOrdering(graph, &ordering);
EXPECT_EQ(independent_set_size, 4);
EXPECT_EQ(ordering.size(), 5);
@@ -219,7 +217,7 @@ TEST(StableIndependentSet, BreakTies) {
// guarantees that it will always be the first vertex in the
// ordering vector.
{
vector<int> ordering;
std::vector<int> ordering;
ordering.push_back(0);
ordering.push_back(1);
ordering.push_back(2);
@@ -231,7 +229,7 @@ TEST(StableIndependentSet, BreakTies) {
}
{
vector<int> ordering;
std::vector<int> ordering;
ordering.push_back(1);
ordering.push_back(0);
ordering.push_back(2);