Lines Matching refs:left_
72 // a vector<int> called 'left_' whose elements are initialized to the
76 // - An edge from source to each left_ node
78 // - An edge from each left_ node to each right_ node, if the
81 // When the TryAugment() method adds a flow, it sets left_[l] = r for some
90 // When the method augments a flow (moving left_[l] from some r1 to some
96 // information in 'graph' and in left_.
128 left_(graph_->LhsSize(), kUnused),
149 // source to sink starting at the left_[ilhs] node.
150 GTEST_CHECK_(left_[ilhs] == kUnused)
151 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs];
157 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) {
158 size_t irhs = left_[ilhs];
179 // Note that left_[ilhs] is the only element of left_ that TryAugment will
181 // left_ element holding kUnused before TryAugment will be holding it
201 // Add flow from left_[ilhs] to right_[irhs].
202 left_[ilhs] = irhs;
211 // Each element of the left_ vector represents a left hand side node
213 // node (i.e. a matcher). The values in the left_ vector indicate
215 // in the right_ indicate inflow, and specify which left_ node is
216 // feeding that right_ node, if any. For example, left_[3] == 1 means
219 // Elements of left_ and right_ are either kUnused or mutually
220 // referent. Mutually referent means that left_[right_[i]] = i and
221 // right_[left_[i]] = i.
222 ::std::vector<size_t> left_;