Lines Matching refs:ilhs
222 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
224 // source to sink starting at the left_[ilhs] node.
225 GTEST_CHECK_(left_[ilhs] == kUnused)
226 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs];
229 TryAugment(ilhs, &seen);
232 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) {
233 size_t irhs = left_[ilhs];
235 result.push_back(ElementMatcherPair(ilhs, irhs));
243 // Perform a depth-first search from left node ilhs to the sink. If a
254 // Note that left_[ilhs] is the only element of left_ that TryAugment will
259 bool TryAugment(size_t ilhs, ::std::vector<char>* seen) {
263 if (!graph_->HasEdge(ilhs, irhs))
265 // There's an available edge from ilhs to irhs.
274 // Otherwise there is residual flow to some ilhs. We push flow
278 // Add flow from left_[ilhs] to right_[irhs].
279 left_[ilhs] = irhs;
280 right_[irhs] = ilhs;
360 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) {
362 char& b = matched_[SpaceIndex(ilhs, irhs)];
374 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) {
376 char& b = matched_[SpaceIndex(ilhs, irhs)];
452 for (size_t ilhs = 0; ilhs < matrix.LhsSize(); ilhs++) {
454 char matched = matrix.HasEdge(ilhs, irhs);
455 element_matched[ilhs] |= matched;