2013-06-11 14:51:51 +00:00
|
|
|
# Copyright 2010-2013 Google
|
2012-02-20 12:09:28 +00:00
|
|
|
# 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.
|
|
|
|
|
|
|
|
|
|
"""Test linear sum assignment on a 4x4 matrix.
|
|
|
|
|
|
|
|
|
|
Example taken from:
|
|
|
|
|
http://www.ee.oulu.fi/~mpa/matreng/eem1_2-1.htm with kCost[0][1]
|
|
|
|
|
modified so the optimum solution is unique.
|
|
|
|
|
"""
|
|
|
|
|
|
|
|
|
|
|
2014-06-13 10:03:03 +00:00
|
|
|
|
2012-02-20 12:09:28 +00:00
|
|
|
from google.apputils import app
|
2013-12-24 11:35:01 +00:00
|
|
|
from ortools.graph import pywrapgraph
|
2012-02-20 12:09:28 +00:00
|
|
|
|
|
|
|
|
|
2013-10-17 08:58:26 +00:00
|
|
|
def RunAssignmentOn4x4Matrix():
|
2012-02-20 12:09:28 +00:00
|
|
|
"""Test linear sum assignment on a 4x4 matrix.
|
|
|
|
|
"""
|
|
|
|
|
num_sources = 4
|
|
|
|
|
num_targets = 4
|
|
|
|
|
cost = [[90, 76, 75, 80],
|
|
|
|
|
[35, 85, 55, 65],
|
|
|
|
|
[125, 95, 90, 105],
|
|
|
|
|
[45, 110, 95, 115]]
|
|
|
|
|
expected_cost = cost[0][3] + cost[1][2] + cost[2][1] + cost[3][0]
|
|
|
|
|
|
2013-10-17 08:58:26 +00:00
|
|
|
assignment = pywrapgraph.LinearSumAssignment()
|
2014-05-22 20:13:16 +00:00
|
|
|
for source in range(0, num_sources):
|
2012-02-20 12:09:28 +00:00
|
|
|
for target in range(0, num_targets):
|
2013-10-17 08:58:26 +00:00
|
|
|
assignment.AddArcWithCost(source, target, cost[source][target])
|
|
|
|
|
|
|
|
|
|
solve_status = assignment.Solve()
|
|
|
|
|
if solve_status == assignment.OPTIMAL:
|
|
|
|
|
print 'Successful solve.'
|
|
|
|
|
print 'Total cost', assignment.OptimalCost(), '/', expected_cost
|
|
|
|
|
for i in range(0, assignment.NumNodes()):
|
|
|
|
|
print 'Left node %d assigned to right node %d with cost %d.' % (
|
|
|
|
|
i,
|
|
|
|
|
assignment.RightMate(i),
|
|
|
|
|
assignment.AssignmentCost(i))
|
|
|
|
|
elif solve_status == assignment.INFEASIBLE:
|
|
|
|
|
print 'No perfect matching exists.'
|
|
|
|
|
elif solve_status == assignment.POSSIBLE_OVERFLOW:
|
|
|
|
|
print 'Some input costs are too large and may cause an integer overflow.'
|
2012-02-20 12:09:28 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
def main(unused_argv):
|
2013-10-17 08:58:26 +00:00
|
|
|
RunAssignmentOn4x4Matrix()
|
2012-02-20 12:09:28 +00:00
|
|
|
|
|
|
|
|
if __name__ == '__main__':
|
|
|
|
|
app.run()
|