Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: hungarian
Note: This documentation is automatically generated.
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.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["This C++ code implements the Hungarian algorithm (Kuhn-Munkres) for solving the assignment problem, finding the optimal assignment of agents to tasks with the least cost."],["It's recommended to use the code in graph/linear_assignment.h due to its better time complexity."],["The functions handle NaN values in the input cost matrix by returning without execution, leaving output assignments unchanged."],["You can find functions for both maximizing and minimizing linear assignments based on the provided cost matrix."],["This implementation is a translation from Java, originally based on a Python version available online."]]],[]]
