Searched refs:weighted_edges (Results 1 – 3 of 3) sorted by relevance
| /external/ceres-solver/internal/ceres/ |
| D | graph_algorithms.h | 276 vector<pair<double, pair<Vertex, Vertex> > > weighted_edges; in Degree2MaximumSpanningForest() local
304 weighted_edges.push_back(make_pair(weight, make_pair(vertex1, vertex2))); in Degree2MaximumSpanningForest()
311 sort(weighted_edges.rbegin(), weighted_edges.rend()); in Degree2MaximumSpanningForest()
315 for (int i =0; i < weighted_edges.size(); ++i) { in Degree2MaximumSpanningForest()
316 const pair<Vertex, Vertex>& edge = weighted_edges[i].second; in Degree2MaximumSpanningForest()
|
| /external/opencv/cvaux/src/ |
| D | cvclique.cpp | 129 …indCliques( CvGraph* graph, CvCliqueFinder* finder, int reverse, int weighted, int weighted_edges )
154 if (weighted_edges)
156 finder->weighted_edges = 1;
183 else finder->weighted_edges = 0;
256 if(finder->weighted_edges)
294 if( finder->weighted && !finder->weighted_edges &&
399 if( finder->weighted_edges )
|
| /external/opencv/cvaux/include/ |
| D | cvaux.h | 329 int weighted_edges; member
|