Lines Matching refs:ilhs
145 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
147 // source to sink starting at the left_[ilhs] node.
148 GTEST_CHECK_(left_[ilhs] == kUnused)
149 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs];
152 TryAugment(ilhs, &seen);
155 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) {
156 size_t irhs = left_[ilhs];
158 result.push_back(ElementMatcherPair(ilhs, irhs));
166 // Perform a depth-first search from left node ilhs to the sink. If a
177 // Note that left_[ilhs] is the only element of left_ that TryAugment will
182 bool TryAugment(size_t ilhs, ::std::vector<char>* seen) {
185 if (!graph_->HasEdge(ilhs, irhs)) continue;
186 // There's an available edge from ilhs to irhs.
195 // Otherwise there is residual flow to some ilhs. We push flow
199 // Add flow from left_[ilhs] to right_[irhs].
200 left_[ilhs] = irhs;
201 right_[irhs] = ilhs;
248 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) {
250 char& b = matched_[SpaceIndex(ilhs, irhs)];
262 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) {
264 char& b = matched_[SpaceIndex(ilhs, irhs)];
377 for (size_t ilhs = 0; ilhs < matrix.LhsSize(); ilhs++) {
379 char matched = matrix.HasEdge(ilhs, irhs);
380 element_matched[ilhs] |= matched;
