HomeSort by relevance Sort by last modified time
    Searched defs:forest (Results 1 - 2 of 2) sorted by null

  /external/ceres-solver/internal/ceres/
graph_algorithms.h 162 // 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...]
  /external/opencv/ml/include/
ml.h 916 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
    [all...]

Completed in 108 milliseconds