Lines Matching full:forest
173 // 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. In the SCHUR_JACOBI
401 // to edges in the degree-2 forest are off diagonal entries of this
504 const Graph<int>& forest,
507 const HashSet<int>& vertices = forest.vertices();
511 // forest.
517 const HashSet<int>& neighbors = forest.Neighbors(cluster1);
566 // of 3D points. The degree-2 maximum spanning forest
