Searched refs:graph_ (Results 1 – 2 of 2) sorted by relevance
235 : graph_(&graph), in MaxBipartiteMatchState()236 left_(graph_->LhsSize(), kUnused), in MaxBipartiteMatchState()237 right_(graph_->RhsSize(), kUnused) {} in MaxBipartiteMatchState()255 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute()261 seen.assign(graph_->RhsSize(), 0); in Compute()293 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in TryAugment()295 if (!graph_->HasEdge(ilhs, irhs)) continue; in TryAugment()318 const MatchMatrix* graph_; // not owned member in testing::internal::MaxBipartiteMatchState
5997 explicit BacktrackingMaxBPMState(const Graph* g) : graph_(g) { } in BacktrackingMaxBPMState()6000 if (graph_->LhsSize() == 0 || graph_->RhsSize() == 0) { in Compute()6003 lhs_used_.assign(graph_->LhsSize(), kUnused); in Compute()6004 rhs_used_.assign(graph_->RhsSize(), kUnused); in Compute()6005 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in Compute()6008 if (best_so_far_.size() == graph_->RhsSize()) in Compute()6037 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in RecurseInto()6041 if (!graph_->HasEdge(ilhs, irhs)) { in RecurseInto()6045 if (best_so_far_.size() == graph_->RhsSize()) { in RecurseInto()6048 for (size_t mi = irhs + 1; mi < graph_->RhsSize(); ++mi) { in RecurseInto()[all …]