google-research

1
// Copyright 2023 The Authors.
2
//
3
// Licensed under the Apache License, Version 2.0 (the "License");
4
// you may not use this file except in compliance with the License.
5
// You may obtain a copy of the License at
6
//
7
//     http://www.apache.org/licenses/LICENSE-2.0
8
//
9
// Unless required by applicable law or agreed to in writing, software
10
// distributed under the License is distributed on an "AS IS" BASIS,
11
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12
// See the License for the specific language governing permissions and
13
// limitations under the License.
14

15
#include "algorithm.h"
16

17
#include <cassert>
18
#include <memory>
19

20
#include "fairness_constraint.h"
21
#include "matroid.h"
22
#include "submodular_function.h"
23

24
void Algorithm::Init(const SubmodularFunction& sub_func_f,
25
                     const FairnessConstraint& fairness,
26
                     const Matroid& matroid) {
27
  sub_func_f_ = sub_func_f.Clone();
28
  sub_func_f_->Reset();
29
  fairness_ = fairness.Clone();
30
  fairness_->Reset();
31
  matroid_ = matroid.Clone();
32
  matroid_->Reset();
33
}
34

35
int Algorithm::GetNumberOfPasses() const {
36
  // default is one-pass
37
  return 1;
38
}
39

40
void Algorithm::BeginNextPass() {
41
  // multi-pass algorithms should overload this, so if we ever reach here,
42
  // this means that the algorithm is single-pass (so this should not be called)
43
  assert(false);
44
}
45