py310-munkres (python/py-munkres) Updated: 2 years, 10 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

16 build(s) found
Builder Build Number Start Time Elapsed Time Watcher Build Status
12 51045 2022-12-11 18:39:25 0:01:16 14991 build successful
10.6 96794 2022-12-11 18:25:36 0:01:23 38182 build successful
11.arm64 76711 2022-12-11 18:17:41 0:00:15 26174 build successful
12.arm64 23836 2021-11-21 23:47:30 0:00:32 1423 build successful
11 53605 2021-11-21 23:23:11 0:02:54 12450 build successful
10.6.x86_64 80577 2021-11-21 23:20:46 0:01:58 24436 build successful
10.6 45310 2021-11-21 23:13:07 0:02:18 24463 build successful
10.14 106972 2021-11-21 23:09:15 0:03:05 33644 build successful
10.11 161472 2021-11-21 22:53:23 0:02:17 51994 build successful
10.15 78765 2021-11-21 22:51:17 0:02:53 22635 build successful
10.13 130602 2021-11-21 22:35:48 0:02:27 42934 build successful
10.8 68176 2021-11-21 22:33:40 0:02:10 22325 build successful
10.10 162828 2021-11-21 21:53:16 0:01:58 52058 build successful
10.7 75974 2021-11-21 21:21:44 0:01:45 24467 build successful
10.12 166198 2021-11-21 21:10:04 0:01:49 50980 build successful
10.9 167518 2021-11-21 20:57:31 0:01:45 51743 build successful