Searched defs:forest (Results 1 - 3 of 3) sorted by relevance

/external/ceres-solver/internal/ceres/
H A Dgraph_algorithms.h254 // Compute a degree two constrained Maximum Spanning Tree/forest of
270 // spanning forest, or a collection of linear paths that span the
277 Graph<Vertex>* forest = new Graph<Vertex>(); local
292 forest->AddVertex(vertex1, graph.VertexWeight(vertex1));
313 // Greedily add edges to the spanning tree/forest as long as they do
323 if ((forest->Neighbors(vertex1).size() == 2) ||
324 (forest->Neighbors(vertex2).size() == 2)) {
342 forest->AddEdge(vertex1, vertex2, edge_weight);
343 forest->AddEdge(vertex2, vertex1, edge_weight);
356 return forest;
[all...]
H A Dvisibility_based_preconditioner.cc156 // forest. The set of edges in this forest are the cluster pairs.
167 // maximum spanning forest of this graph.
172 scoped_ptr<Graph<int> > forest(
174 ForestToClusterPairs(*forest, &cluster_pairs_);
233 // spanning forest.
240 // connected by an edge in the degree-2 maximum spanning forest.
242 // Since we have already expanded the forest into a set of camera
368 // the degree-2 forest and that guarantees positive
382 // belong to the edges of the degree-2 forest
500 ForestToClusterPairs( const Graph<int>& forest, HashSet<pair<int, int> >* cluster_pairs) const argument
[all...]
/external/opencv/ml/include/
H A Dml.h916 virtual bool train( CvDTreeTrainData* _train_data, const CvMat* _subsample_idx, CvRTrees* forest );
919 virtual void read( CvFileStorage* fs, CvFileNode* node, CvRTrees* forest, CvDTreeTrainData* _data );
936 CvRTrees* forest; member in class:CvForestTree
942 //Parameters for the forest
1000 // array of the trees of the forest

Completed in 331 milliseconds