Home
last modified time | relevance | path

Searched refs:forest (Results 1 – 7 of 7) sorted by relevance

/external/ceres-solver/internal/ceres/
Dgraph_algorithms_test.cc111 scoped_ptr<Graph<int> > forest(Degree2MaximumSpanningForest(graph)); in TEST() local
113 const HashSet<int>& vertices = forest->vertices(); in TEST()
115 EXPECT_EQ(forest->VertexWeight(0), 1.0); in TEST()
116 EXPECT_EQ(forest->VertexWeight(1), 2.0); in TEST()
117 EXPECT_EQ(forest->Neighbors(0).size(), 1.0); in TEST()
118 EXPECT_EQ(forest->EdgeWeight(0, 1), 0.5); in TEST()
134 scoped_ptr<Graph<int> > forest(Degree2MaximumSpanningForest(graph)); in TEST() local
135 const HashSet<int>& vertices = forest->vertices(); in TEST()
139 const HashSet<int>& neighbors = forest->Neighbors(0); in TEST()
146 const HashSet<int>& neighbors = forest->Neighbors(3); in TEST()
[all …]
Dgraph_algorithms.h277 Graph<Vertex>* forest = new Graph<Vertex>(); in Degree2MaximumSpanningForest() local
292 forest->AddVertex(vertex1, graph.VertexWeight(vertex1)); in Degree2MaximumSpanningForest()
323 if ((forest->Neighbors(vertex1).size() == 2) || in Degree2MaximumSpanningForest()
324 (forest->Neighbors(vertex2).size() == 2)) { in Degree2MaximumSpanningForest()
342 forest->AddEdge(vertex1, vertex2, edge_weight); in Degree2MaximumSpanningForest()
343 forest->AddEdge(vertex2, vertex1, edge_weight); in Degree2MaximumSpanningForest()
356 return forest; in Degree2MaximumSpanningForest()
Dvisibility_based_preconditioner.cc172 scoped_ptr<Graph<int> > forest( in ComputeClusterTridiagonalSparsity() local
174 ForestToClusterPairs(*forest, &cluster_pairs_); in ComputeClusterTridiagonalSparsity()
501 const Graph<int>& forest, in ForestToClusterPairs() argument
504 const HashSet<int>& vertices = forest.vertices(); in ForestToClusterPairs()
514 const HashSet<int>& neighbors = forest.Neighbors(cluster1); in ForestToClusterPairs()
Dvisibility_based_preconditioner.h160 void ForestToClusterPairs(const Graph<int>& forest,
/external/opencv/ml/src/
Dmlrtrees.cpp45 forest = NULL; in CvForestTree()
67 forest = _forest; in train()
105 if( forest ) in find_best_split()
108 CvRNG* rng = forest->get_rng(); in find_best_split()
110 active_var_mask = forest->get_active_var_mask(); in find_best_split()
164 forest = _forest; in read()
/external/opencv/ml/include/
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; variable
/external/icu/icu4j/main/shared/data/
DTransliterator_Han_Latin_Definition.txt1912 碑林 < the\-forest\-of\-steles\-\(in\-xi''an\);
4551 魅 < kind\-of\-forest\-demon;
17390 林 < forest;
26268 碑林 > the\-forest\-of\-steles\-\(in\-xi''an\);
33512 森林 > forest;
39084 魅 > kind\-of\-forest\-demon;
49030 林 > forest;
49292 森 > forest;
50718 林 > forest;