Searched refs:edges_ (Results 1 – 4 of 4) sorted by relevance
58 edges_[vertex] = HashSet<Vertex>(); in AddVertex()76 const HashSet<Vertex>& sinks = edges_[vertex]; in RemoveVertex()84 edges_[*it].erase(vertex); in RemoveVertex()87 edges_.erase(vertex); in RemoveVertex()101 if (edges_[vertex1].insert(vertex2).second) { in AddEdge()102 edges_[vertex2].insert(vertex1); in AddEdge()138 return FindOrDie(edges_, vertex); in Neighbors()152 HashMap<Vertex, HashSet<Vertex> > edges_; variable
163 if (recycled_nodes_.getBit(edges_[i].from) || in newNode()164 recycled_nodes_.getBit(edges_[i].to)) { in newNode()165 Swap(edges_[i], edges_[n_edges_ - 1]); in newNode()252 if (n_edges_ < ARRAY_SIZE(edges_)) { in addEdges()256 edges_[n_edges_++] = e; in addEdges()269 if (edges_[i].from == from_idx && edges_[i].to == to_idx) { in findEdge()270 *stk_from = edges_[i].stk_from; in findEdge()271 *stk_to = edges_[i].stk_to; in findEdge()272 *unique_tid = edges_[i].unique_tid; in findEdge()410 Edge edges_[BV::kSize * 32]; variable
164 List<HeapGraphEdge>& edges() { return edges_; } in edges()193 List<HeapGraphEdge> edges_; variable
341 GetMemoryUsedByList(edges_) + in RawSnapshotSize()