C++ Reference: class SimpleLinearSumAssignment
Note: This documentation is automatically generated.
| Method | |
|---|---|
AddArcWithCost | Return type: Arguments: Adds an arc from a left node to a right node with a given cost. * Node indices must be non-negative (>= 0). For a perfect matching to exist on n nodes, the values taken by "left_node" must cover [0, n), same for "right_node". * The arc cost can be any integer, negative, positive or zero. * After the method finishes, NumArcs() == the returned ArcIndex + 1. |
AssignmentCost | Return type: Arguments: Returns the cost of the arc used for "left_node"'s assignment. This works only if Solve() returned OPTIMAL. |
Cost | Return type: Arguments: |
LeftNode | Return type: Arguments: Returns user-provided data. The implementation will crash if "arc" is not in [0, NumArcs()). |
NumArcs | Return type: Returns the current number of arcs in the graph. |
NumNodes | Return type: Returns the current number of left nodes which is the same as the number of right nodes. This is one greater than the largest node index seen so far in AddArcWithCost(). |
OptimalCost | Return type: Returns the cost of an assignment with minimal cost. This is 0 if the last Solve() didn't return OPTIMAL. |
RightMate | Return type: Arguments: Returns the right node assigned to the given left node in the last solution computed by Solve(). This works only if Solve() returned OPTIMAL. Note: It is possible that there is more than one optimal solution. The algorithm is deterministic so it will always return the same solution for a given problem. There is no such guarantee from one code version to the next, but the code does not change often. |
RightNode | Return type: Arguments: |
SimpleLinearSumAssignment | The constructor takes no size. New node indices will be created lazily by AddArcWithCost(). |
Solve | Return type: |