Searched refs:blocked_graph_ (Results 1 – 2 of 2) sorted by relevance
94 blocked_graph_.clear(); in BreakCycles()95 blocked_graph_.resize(subgraph_.size()); in BreakCycles()136 for (Vertex::EdgeMap::iterator it = blocked_graph_[u].out_edges.begin(); in Unblock()137 it != blocked_graph_[u].out_edges.end(); ) { in Unblock()139 blocked_graph_[u].out_edges.erase(it++); in Unblock()199 if (blocked_graph_[*w].out_edges.find(vertex) == in Circuit()200 blocked_graph_[*w].out_edges.end()) { in Circuit()201 blocked_graph_[*w].out_edges.insert(make_pair(vertex, in Circuit()
60 Graph blocked_graph_; // "B" in the paper variable