Searched refs:EdgeWeight (Results 1 – 9 of 9) sorted by relevance
| /external/ceres-solver/internal/ceres/ |
| D | graph_test.cc | 57 EXPECT_EQ(graph.EdgeWeight(0, 1), 0.5); in TEST()
58 EXPECT_EQ(graph.EdgeWeight(1, 0), 0.5); in TEST()
82 EXPECT_EQ(graph.EdgeWeight(0, 1), 0.5); in TEST()
83 EXPECT_EQ(graph.EdgeWeight(1, 0), 0.5); in TEST()
103 EXPECT_EQ(graph.EdgeWeight(2, 3), 0); in TEST()
|
| D | visibility_test.cc | 124 EXPECT_EQ(graph->EdgeWeight(i, j), edge_weight) in TEST()
126 << " weight: " << graph->EdgeWeight(i, j) in TEST()
199 EXPECT_EQ(graph->EdgeWeight(i, j), edge_weight) in TEST()
201 << " weight: " << graph->EdgeWeight(i, j) in TEST()
|
| D | canonical_views_clustering.cc | 177 const double new_similarity = graph_->EdgeWeight(*neighbor, candidate); in ComputeClusteringQualityDifference()
189 graph_->EdgeWeight(centers[i], candidate); in ComputeClusteringQualityDifference()
205 graph_->EdgeWeight(*neighbor, canonical_view); in UpdateCanonicalViewAssignments()
|
| D | single_linkage_clustering.cc | 72 (graph.EdgeWeight(vertex1, vertex2) < options.min_similarity)) { in ComputeSingleLinkageClustering()
|
| D | graph_algorithms.h | 303 const double weight = graph.EdgeWeight(vertex1, vertex2); in Degree2MaximumSpanningForest()
341 const double edge_weight = graph.EdgeWeight(vertex1, vertex2); in Degree2MaximumSpanningForest()
|
| D | graph.h | 127 double EdgeWeight(const Vertex& vertex1, const Vertex& vertex2) const { in EdgeWeight() function
|
| D | graph_algorithms_test.cc | 118 EXPECT_EQ(forest->EdgeWeight(0, 1), 0.5); in TEST()
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| D | MaximumSpanningTree.h | 31 typedef std::pair<Edge, double> EdgeWeight; typedef
32 typedef std::vector<EdgeWeight> EdgeWeights;
46 bool operator()(EdgeWeight X, EdgeWeight Y) const { in operator()
|
| /external/llvm/include/llvm/Support/ |
| D | GCOV.h | 298 struct EdgeWeight { struct
299 EdgeWeight(GCOVBlock *D) : Dst(D), Count(0) {} in EdgeWeight() function
|