Searched refs:forest (Results 1 - 6 of 6) sorted by relevance

/external/ceres-solver/internal/ceres/
H A Dgraph_algorithms_test.cc111 scoped_ptr<Graph<int> > forest(Degree2MaximumSpanningForest(graph));
113 const HashSet<int>& vertices = forest->vertices();
115 EXPECT_EQ(forest->VertexWeight(0), 1.0);
116 EXPECT_EQ(forest->VertexWeight(1), 2.0);
117 EXPECT_EQ(forest->Neighbors(0).size(), 1.0);
118 EXPECT_EQ(forest->EdgeWeight(0, 1), 0.5);
134 scoped_ptr<Graph<int> > forest(Degree2MaximumSpanningForest(graph));
135 const HashSet<int>& vertices = forest->vertices();
139 const HashSet<int>& neighbors = forest->Neighbors(0);
146 const HashSet<int>& neighbors = forest
[all...]
H A Dgraph_algorithms.h162 // Compute a degree two constrained Maximum Spanning Tree/forest of
178 // spanning forest, or a collection of linear paths that span the
185 Graph<Vertex>* forest = new Graph<Vertex>(); local
200 forest->AddVertex(vertex1, graph.VertexWeight(vertex1));
221 // Greedily add edges to the spanning tree/forest as long as they do
231 if ((forest->Neighbors(vertex1).size() == 2) ||
232 (forest->Neighbors(vertex2).size() == 2)) {
250 forest->AddEdge(vertex1, vertex2, edge_weight);
251 forest->AddEdge(vertex2, vertex1, edge_weight);
264 return forest;
[all...]
H A Dvisibility_based_preconditioner.h116 // maximum spanning forest is identified in this graph and the camera
117 // pairs contained in the edges of this forest are added to the
204 void ForestToClusterPairs(const Graph<int>& forest,
H A Dvisibility_based_preconditioner.cc173 // forest. The set of edges in this forest are the cluster pairs.
184 // maximum spanning forest of this graph.
189 scoped_ptr<Graph<int> > forest(
191 ForestToClusterPairs(*forest, &cluster_pairs_);
236 // spanning forest.
243 // connected by an edge in the degree-2 maximum spanning forest.
245 // Since we have already expanded the forest into a set of camera
375 // edges in the degree-2 forest and that guarantees positive
385 // belong to the edges of the degree-2 forest
503 ForestToClusterPairs( const Graph<int>& forest, HashSet<pair<int, int> >* cluster_pairs) const argument
[all...]
/external/opencv/ml/src/
H A Dmlrtrees.cpp45 forest = NULL;
67 forest = _forest;
105 if( forest )
108 CvRNG* rng = forest->get_rng();
110 active_var_mask = forest->get_active_var_mask();
164 forest = _forest;
/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 109 milliseconds