always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

use pybind11 for ortools/graph

Browse Source
This commit is contained in:
Laurent Perron
2022-03-31 18:21:20 +02:00
parent 1b7ea70824
commit 8ef66920d9
4 changed files with 40 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
examples/python/linear_assignment_api.py
View File

@@ -19,7 +19,7 @@
"""
from absl import app
from ortools.graph import pywrapgraph
from ortools.graph.python import linear_sum_assignment
def RunAssignmentOn4x4Matrix():
@@ -30,18 +30,18 @@ def RunAssignmentOn4x4Matrix():
[45, 110, 95, 115]]
expected_cost = cost[0][3] + cost[1][2] + cost[2][1] + cost[3][0]
assignment = pywrapgraph.LinearSumAssignment()
assignment = linear_sum_assignment.SimpleLinearSumAssignment()
for source in range(0, num_sources):
for target in range(0, num_targets):
assignment.AddArcWithCost(source, target, cost[source][target])
assignment.add_arc_with_cost(source, target, cost[source][target])
solve_status = assignment.Solve()
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('Total cost', assignment.optimal_cost(), '/', expected_cost)
for i in range(0, assignment.num_nodes()):
print('Left node %d assigned to right node %d with cost %d.' %
(i, assignment.RightMate(i), assignment.AssignmentCost(i)))
(i, assignment.right_mate(i), assignment.assignment_cost(i)))
elif solve_status == assignment.INFEASIBLE:
print('No perfect matching exists.')
elif solve_status == assignment.POSSIBLE_OVERFLOW: