Lines Matching full:neighbors
52 if (graph_.Neighbors(lhs).size() == graph_.Neighbors(rhs).size()) {
55 return graph_.Neighbors(lhs).size() < graph_.Neighbors(rhs).size();
108 // to the independent set. Mark it black and its neighbors grey.
117 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex);
118 for (typename HashSet<Vertex>::const_iterator it = neighbors.begin();
119 it != neighbors.end();
203 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex1);
204 for (typename HashSet<Vertex>::const_iterator it2 = neighbors.begin();
205 it2 != neighbors.end();
231 if ((forest->Neighbors(vertex1).size() == 2) ||
232 (forest->Neighbors(vertex2).size() == 2)) {
