Home | History | Annotate | Download | only in src

Lines Matching full:right_

151 //   - An edge from each right_ node to sink
152 // - An edge from each left_ node to each right_ node, if the
172 // As an optimization, there is a second vector<int> called right_ which
203 right_(graph_->RhsSize(), kUnused) {
270 // right_[irhs] == kUnused means that there is residual flow from
277 if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) {
278 // Add flow from left_[ilhs] to right_[irhs].
280 right_[irhs] = ilhs;
289 // (i.e. an element) and each element of right_ is a right hand side
291 // outflow from that node to a node on the the right_ side. The values
292 // in the right_ indicate inflow, and specify which left_ node is
293 // feeding that right_ node, if any. For example, left_[3] == 1 means
295 // be redundantly represented in the right_ vector as right_[1] == 3.
296 // Elements of left_ and right_ are either kUnused or mutually
297 // referent. Mutually referent means that left_[right_[i]] = i and
298 // right_[left_[i]] = i.
300 ::std::vector<size_t> right_;