Lines Matching refs:ilhs
255 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
257 // source to sink starting at the left_[ilhs] node.
258 GTEST_CHECK_(left_[ilhs] == kUnused)
259 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs];
262 TryAugment(ilhs, &seen);
265 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) {
266 size_t irhs = left_[ilhs];
268 result.push_back(ElementMatcherPair(ilhs, irhs));
276 // Perform a depth-first search from left node ilhs to the sink. If a
287 // Note that left_[ilhs] is the only element of left_ that TryAugment will
292 bool TryAugment(size_t ilhs, ::std::vector<char>* seen) {
295 if (!graph_->HasEdge(ilhs, irhs)) continue;
296 // There's an available edge from ilhs to irhs.
305 // Otherwise there is residual flow to some ilhs. We push flow
309 // Add flow from left_[ilhs] to right_[irhs].
310 left_[ilhs] = irhs;
311 right_[irhs] = ilhs;
358 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) {
360 char& b = matched_[SpaceIndex(ilhs, irhs)];
372 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) {
374 char& b = matched_[SpaceIndex(ilhs, irhs)];
487 for (size_t ilhs = 0; ilhs < matrix.LhsSize(); ilhs++) {
489 char matched = matrix.HasEdge(ilhs, irhs);
490 element_matched[ilhs] |= matched;