py39-munkres (python/py-munkres) Updated: 3 years, 5 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

21 build(s) found
Builder Build Number Start Time Elapsed Time Watcher Build Status
10.8 112613 2022-12-11 19:51:45 0:00:08 36000 build successful
12 51131 2022-12-11 19:51:23 0:00:12 14991 build successful
10.6 96880 2022-12-11 19:51:16 0:00:16 38182 build successful
10.9 210540 2022-12-11 19:16:49 0:00:12 65221 build successful
10.10 205151 2022-12-11 19:11:14 0:00:12 65529 build successful
10.6.x86_64 131794 2022-12-11 19:09:21 0:00:18 38212 build successful
10.7 123010 2022-12-11 19:05:14 0:00:14 37960 build successful
10.12 210124 2022-12-11 19:05:14 0:00:16 64453 build successful
11.arm64 76789 2022-12-11 18:53:25 0:00:08 26174 build successful
12.arm64 2433 2021-11-02 12:00:34 0:00:31 159 build successful
11 45654 2021-09-08 21:18:14 0:02:38 9594 build successful
10.14 98965 2021-09-08 21:16:39 0:02:09 30787 build successful
10.11 153182 2021-09-08 21:16:03 0:02:24 49137 build successful
10.15 70729 2021-09-08 21:15:53 0:02:29 19780 build successful
10.13 122464 2021-09-08 21:14:15 0:01:53 40077 build successful
10.6.x86_64 72527 2021-09-08 21:12:54 0:01:50 21574 build successful
10.8 59935 2021-09-08 21:11:25 0:01:33 19468 build successful
10.12 158088 2021-09-08 21:11:09 0:01:49 48125 build successful
10.10 154526 2021-09-08 21:11:02 0:01:37 49200 build successful
10.9 158832 2021-09-08 21:10:54 0:01:28 48886 build successful
10.7 67667 2021-09-08 21:10:47 0:01:25 21609 build successful