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

  /external/ceres-solver/internal/ceres/
graph_test.cc 57 EXPECT_EQ(graph.EdgeWeight(0, 1), 0.5);
58 EXPECT_EQ(graph.EdgeWeight(1, 0), 0.5);
82 EXPECT_EQ(graph.EdgeWeight(0, 1), 0.5);
83 EXPECT_EQ(graph.EdgeWeight(1, 0), 0.5);
103 EXPECT_EQ(graph.EdgeWeight(2, 3), 0);
canonical_views_clustering.cc 177 const double new_similarity = graph_->EdgeWeight(*neighbor, candidate);
189 graph_->EdgeWeight(centers[i], candidate);
205 graph_->EdgeWeight(*neighbor, canonical_view);
single_linkage_clustering.cc 72 (graph.EdgeWeight(vertex1, vertex2) < options.min_similarity)) {
visibility_test.cc 124 EXPECT_EQ(graph->EdgeWeight(i, j), edge_weight)
126 << " weight: " << graph->EdgeWeight(i, j)
199 EXPECT_EQ(graph->EdgeWeight(i, j), edge_weight)
201 << " weight: " << graph->EdgeWeight(i, j)
graph.h 123 // Calling EdgeWeight on a pair of vertices where either one of the
127 double EdgeWeight(const Vertex& vertex1, const Vertex& vertex2) const {
graph_algorithms.h 303 const double weight = graph.EdgeWeight(vertex1, vertex2);
341 const double edge_weight = graph.EdgeWeight(vertex1, vertex2);
graph_algorithms_test.cc 118 EXPECT_EQ(forest->EdgeWeight(0, 1), 0.5);
  /external/llvm/lib/Transforms/Instrumentation/
MaximumSpanningTree.h 31 typedef std::pair<Edge, double> EdgeWeight;
32 typedef std::vector<EdgeWeight> EdgeWeights;
46 bool operator()(EdgeWeight X, EdgeWeight Y) const {
  /external/llvm/include/llvm/Support/
GCOV.h 293 struct EdgeWeight {
294 EdgeWeight(GCOVBlock *D): Dst(D), Count(0) {}

Completed in 1343 milliseconds