py38-munkres (python/py-munkres) Updated: 3 years, 2 months ago Add to my watchlist

Munkres algorithm for Python

The Munkres module provides an O(n^3) implementation of the Munkres algorithm (also called the Hungarian algorithm or the Kuhn-Munkres algorithm). The algorithm models an assignment problem as an NxM cost matrix, where each element represents the cost of assigning the ith worker to the jth job, and it figures out the least-cost solution, choosing a single item from each row and column in the matrix, such that no row and no column are used more than once.

Version: 1.1.4 License: Apache-2 GitHub
Reset

18 build(s) found
Builder Build Number Start Time Elapsed Time Watcher Build Status
12 51108 2022-12-11 19:36:34 0:00:19 14991 build successful
10.6 96857 2022-12-11 19:30:56 0:00:25 38182 build successful
10.8 112590 2022-12-11 19:28:21 0:00:14 36000 build successful
10.9 210517 2022-12-11 19:01:12 0:00:17 65221 build successful
10.10 205128 2022-12-11 18:53:03 0:00:13 65529 build successful
11.arm64 76764 2022-12-11 18:42:38 0:00:08 26174 build successful
12.arm64 15592 2021-11-15 5:33:29 0:00:31 1069 build successful
11 45657 2021-09-08 21:27:53 0:02:47 9594 build successful
10.15 70732 2021-09-08 21:24:17 0:02:27 19780 build successful
10.14 98968 2021-09-08 21:23:45 0:02:02 30787 build successful
10.11 153185 2021-09-08 21:23:45 0:02:00 49137 build successful
10.6.x86_64 72530 2021-09-08 21:19:22 0:01:44 21574 build successful
10.13 122466 2021-09-08 21:19:08 0:01:37 40077 build successful
10.8 59938 2021-09-08 21:17:23 0:01:34 19468 build successful
10.12 158091 2021-09-08 21:17:19 0:01:37 48125 build successful
10.10 154529 2021-09-08 21:16:55 0:01:38 49200 build successful
10.9 158835 2021-09-08 21:16:13 0:01:30 48886 build successful
10.7 67670 2021-09-08 21:16:10 0:01:28 21609 build successful