Lines Matching refs:HashSet

98   const HashSet<Vertex>& vertices = graph.vertices();  in IndependentSetOrdering()
113   for (typename HashSet<Vertex>::const_iterator it = vertices.begin();  in IndependentSetOrdering()
134     const HashSet<Vertex>& neighbors = graph.Neighbors(vertex);  in IndependentSetOrdering()
135     for (typename HashSet<Vertex>::const_iterator it = neighbors.begin();  in IndependentSetOrdering()
175   const HashSet<Vertex>& vertices = graph.vertices();  in StableIndependentSetOrdering()
191   for (typename HashSet<Vertex>::const_iterator it = vertices.begin();  in StableIndependentSetOrdering()
209     const HashSet<Vertex>& neighbors = graph.Neighbors(vertex);  in StableIndependentSetOrdering()
210     for (typename HashSet<Vertex>::const_iterator it = neighbors.begin();  in StableIndependentSetOrdering()
287   const HashSet<Vertex>& vertices = graph.vertices();  in Degree2MaximumSpanningForest()
288   for (typename HashSet<Vertex>::const_iterator it = vertices.begin();  in Degree2MaximumSpanningForest()
295     const HashSet<Vertex>& neighbors = graph.Neighbors(vertex1);  in Degree2MaximumSpanningForest()
296     for (typename HashSet<Vertex>::const_iterator it2 = neighbors.begin();  in Degree2MaximumSpanningForest()