Lines Matching refs:neighbors
55 if (graph_.Neighbors(lhs).size() == graph_.Neighbors(rhs).size()) {
58 return graph_.Neighbors(lhs).size() < graph_.Neighbors(rhs).size();
72 return graph_.Neighbors(lhs).size() < graph_.Neighbors(rhs).size();
125 // to the independent set. Mark it black and its neighbors grey.
134 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex);
135 for (typename HashSet<Vertex>::const_iterator it = neighbors.begin();
136 it != neighbors.end();
200 // to the independent set. Mark it black and its neighbors grey.
209 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex);
210 for (typename HashSet<Vertex>::const_iterator it = neighbors.begin();
211 it != neighbors.end();
295 const HashSet<Vertex>& neighbors = graph.Neighbors(vertex1);
296 for (typename HashSet<Vertex>::const_iterator it2 = neighbors.begin();
297 it2 != neighbors.end();
323 if ((forest->Neighbors(vertex1).size() == 2) ||
324 (forest->Neighbors(vertex2).size() == 2)) {
