Lines Matching full:forest
152 // forest. The set of edges in this forest are the cluster pairs.
163 // maximum spanning forest of this graph.
168 scoped_ptr<Graph<int> > forest(
170 ForestToClusterPairs(*forest, &cluster_pairs_);
215 // spanning forest.
222 // connected by an edge in the degree-2 maximum spanning forest.
224 // Since we have already expanded the forest into a set of camera
353 // the degree-2 forest and that guarantees positive
363 // belong to the edges of the degree-2 forest. In the CLUSTER_JACOBI
379 // to edges in the degree-2 forest are off diagonal entries of this
472 const Graph<int>& forest,
475 const HashSet<int>& vertices = forest.vertices();
479 // forest.
485 const HashSet<int>& neighbors = forest.Neighbors(cluster1);
534 // of 3D points. The degree-2 maximum spanning forest
