Lines Matching defs:vertices
155 // vertices and approximating it with a degree-2 maximum spanning
504 const HashSet<int>& vertices = forest.vertices();
505 CHECK_EQ(vertices.size(), num_clusters_);
509 for (HashSet<int>::const_iterator it1 = vertices.begin();
510 it1 != vertices.end();
541 // Construct a graph whose vertices are the clusters, and the edge
543 // vertices.
574 // Canonical views clustering returns a HashMap from vertices to
576 // possible that some of the vertices may not be associated with any