Searched refs:graph_ (Results 1 – 2 of 2) sorted by relevance
127 : graph_(&graph), in MaxBipartiteMatchState()128 left_(graph_->LhsSize(), kUnused), in MaxBipartiteMatchState()129 right_(graph_->RhsSize(), kUnused) {} in MaxBipartiteMatchState()147 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute()153 seen.assign(graph_->RhsSize(), 0); in Compute()185 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in TryAugment()187 if (!graph_->HasEdge(ilhs, irhs)) continue; in TryAugment()210 const MatchMatrix* graph_; // not owned member in testing::internal::MaxBipartiteMatchState
415 explicit BacktrackingMaxBPMState(const Graph* g) : graph_(g) {} in BacktrackingMaxBPMState()418 if (graph_->LhsSize() == 0 || graph_->RhsSize() == 0) { in Compute()421 lhs_used_.assign(graph_->LhsSize(), kUnused); in Compute()422 rhs_used_.assign(graph_->RhsSize(), kUnused); in Compute()423 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in Compute()426 if (best_so_far_.size() == graph_->RhsSize()) break; in Compute()454 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in RecurseInto()458 if (!graph_->HasEdge(ilhs, irhs)) { in RecurseInto()462 if (best_so_far_.size() == graph_->RhsSize()) { in RecurseInto()465 for (size_t mi = irhs + 1; mi < graph_->RhsSize(); ++mi) { in RecurseInto()[all …]