Lines Matching full:edge
39 void CycleBreaker::BreakCycles(const Graph& graph, set<Edge>* out_cut_edges) {
85 // add a subgraph_ edge
110 Edge min_edge = make_pair(stack_[0], stack_[1]);
115 Edge edge = make_pair(*it, *(it + 1));
116 if (cut_edges_.find(edge) != cut_edges_.end()) {
120 uint64_t edge_weight = graph_utils::EdgeWeight(subgraph_, edge);
123 min_edge = edge;
148 Edge edge = make_pair(*(it - 1), *it);
149 if (utils::SetContainsKey(cut_edges_, edge)) {
