HomeSort by relevance Sort by last modified time
    Searched refs:Neighbors (Results 1 - 8 of 8) sorted by null

  /external/ceres-solver/internal/ceres/
graph_test.cc 55 EXPECT_EQ(graph.Neighbors(0).size(), 1);
56 EXPECT_EQ(graph.Neighbors(1).size(), 1);
80 EXPECT_EQ(graph.Neighbors(0).size(), 1);
81 EXPECT_EQ(graph.Neighbors(1).size(), 1);
93 EXPECT_DEATH_IF_SUPPORTED(graph.Neighbors(2), "key not found");
parameter_block_ordering_test.cc 96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]); local
97 EXPECT_EQ(neighbors.size(), 2);
98 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end());
99 EXPECT_TRUE(neighbors.find(parameter_blocks[3]) != neighbors.end());
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]); local
104 EXPECT_EQ(neighbors.size(), 1)
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]); local
117 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[3]); local
152 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]); local
158 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]); local
165 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[3]); local
    [all...]
graph_algorithms.h 55 if (graph_.Neighbors(lhs).size() == graph_.Neighbors(rhs).size()) {
58 return graph_.Neighbors(lhs).size() < graph_.Neighbors(rhs).size();
72 return graph_.Neighbors(lhs).size() < graph_.Neighbors(rhs).size();
125 // to the independent set. Mark it black and its neighbors grey.
134 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex); local
135 for (typename HashSet<Vertex>::const_iterator it = neighbors.begin()
209 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex); local
295 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex1); local
    [all...]
graph_algorithms_test.cc 117 EXPECT_EQ(forest->Neighbors(0).size(), 1.0);
139 const HashSet<int>& neighbors = forest->Neighbors(0); local
140 EXPECT_EQ(neighbors.size(), 2);
141 EXPECT_TRUE(neighbors.find(4) != neighbors.end());
142 EXPECT_TRUE(neighbors.find(3) != neighbors.end());
146 const HashSet<int>& neighbors = forest->Neighbors(3) local
152 const HashSet<int>& neighbors = forest->Neighbors(4); local
158 const HashSet<int>& neighbors = forest->Neighbors(1); local
163 const HashSet<int>& neighbors = forest->Neighbors(2); local
    [all...]
single_linkage_clustering.cc 63 const HashSet<int>& neighbors = graph.Neighbors(vertex1); local
64 for (HashSet<int>::const_iterator it2 = neighbors.begin();
65 it2 != neighbors.end();
canonical_views_clustering.cc 170 // neighbors became members of its cluster.
171 const IntSet& neighbors = graph_->Neighbors(candidate); local
172 for (IntSet::const_iterator neighbor = neighbors.begin();
173 neighbor != neighbors.end();
198 const IntSet& neighbors = graph_->Neighbors(canonical_view); local
199 for (IntSet::const_iterator neighbor = neighbors.begin();
200 neighbor != neighbors.end();
graph.h 135 // Calling Neighbors on a vertex not in the graph will result in
137 const HashSet<Vertex>& Neighbors(const Vertex& vertex) const {
visibility_based_preconditioner.cc 514 const HashSet<int>& neighbors = forest.Neighbors(cluster1); local
515 for (HashSet<int>::const_iterator it2 = neighbors.begin();
516 it2 != neighbors.end();

Completed in 501 milliseconds