Searched refs:blocked_graph_ (Results 1 – 2 of 2) sorted by relevance
97 blocked_graph_.clear(); in BreakCycles()98 blocked_graph_.resize(subgraph_.size()); in BreakCycles()139 for (Vertex::EdgeMap::iterator it = blocked_graph_[u].out_edges.begin(); in Unblock()140 it != blocked_graph_[u].out_edges.end();) { in Unblock()142 blocked_graph_[u].out_edges.erase(it++); in Unblock()206 if (blocked_graph_[*w].out_edges.find(vertex) == in Circuit()207 blocked_graph_[*w].out_edges.end()) { in Circuit()208 blocked_graph_[*w].out_edges.insert( in Circuit()
60 Graph blocked_graph_; // "B" in the paper variable