Lines Matching refs:right_
185 // - An edge from each right_ node to sink
186 // - An edge from each left_ node to each right_ node, if the
206 // As an optimization, there is a second vector<int> called right_ which
237 right_(graph_->RhsSize(), kUnused) {}
301 // right_[irhs] == kUnused means that there is residual flow from
308 if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) {
309 // Add flow from left_[ilhs] to right_[irhs].
311 right_[irhs] = ilhs;
320 // (i.e. an element) and each element of right_ is a right hand side
322 // outflow from that node to a node on the right_ side. The values
323 // in the right_ indicate inflow, and specify which left_ node is
324 // feeding that right_ node, if any. For example, left_[3] == 1 means
326 // be redundantly represented in the right_ vector as right_[1] == 3.
327 // Elements of left_ and right_ are either kUnused or mutually
328 // referent. Mutually referent means that left_[right_[i]] = i and
329 // right_[left_[i]] = i.
331 ::std::vector<size_t> right_;