8bb54b04ef
FYI: find ortools \( -type d -name .git -prune \) -o -type f -print0 | xargs -0 sed -i 's/\(Copyright 2010\)-2018/\1-2021/g'
62 lines
2.3 KiB
C++
62 lines
2.3 KiB
C++
// Copyright 2010-2021 Google LLC
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
//
|
|
// IMPORTANT NOTE: we advise using the code in
|
|
// graph/linear_assignment.h whose complexity is
|
|
// usually much smaller.
|
|
// TODO(user): base this code on LinearSumAssignment.
|
|
//
|
|
// For each of the four functions declared in this file, in case the input
|
|
// parameter 'cost' contains NaN, the function will return without invoking the
|
|
// Hungarian algorithm, and the output parameters 'direct_assignment' and
|
|
// 'reverse_assignment' will be left unchanged.
|
|
//
|
|
|
|
// An O(n^4) implementation of the Kuhn-Munkres algorithm (a.k.a. the
|
|
// Hungarian algorithm) for solving the assignment problem.
|
|
// The assignment problem takes a set of agents, a set of tasks and a
|
|
// cost associated with assigning each agent to each task and produces
|
|
// an optimal (i.e., least cost) assignment of agents to tasks.
|
|
// The code also enables computing a maximum assignment by changing the
|
|
// input matrix.
|
|
//
|
|
// This code is based on (read: translated from) the Java version
|
|
// (read: translated from) the Python version at
|
|
// http://www.clapper.org/software/python/munkres/.
|
|
|
|
#ifndef OR_TOOLS_ALGORITHMS_HUNGARIAN_H_
|
|
#define OR_TOOLS_ALGORITHMS_HUNGARIAN_H_
|
|
|
|
#include <vector>
|
|
|
|
#include "absl/container/flat_hash_map.h"
|
|
|
|
namespace operations_research {
|
|
|
|
// See IMPORTANT NOTE at the top of the file.
|
|
void MinimizeLinearAssignment(
|
|
const std::vector<std::vector<double> >& cost,
|
|
absl::flat_hash_map<int, int>* direct_assignment,
|
|
absl::flat_hash_map<int, int>* reverse_assignment);
|
|
|
|
// See IMPORTANT NOTE at the top of the file.
|
|
void MaximizeLinearAssignment(
|
|
const std::vector<std::vector<double> >& cost,
|
|
absl::flat_hash_map<int, int>* direct_assignment,
|
|
absl::flat_hash_map<int, int>* reverse_assignment);
|
|
|
|
} // namespace operations_research
|
|
|
|
#endif // OR_TOOLS_ALGORITHMS_HUNGARIAN_H_
|