| Index | index by Group | index by Distribution | index by Vendor | index by creation date | index by Name | Mirrors | Help |
The search service can find package by either name (apache), provides(webserver), absolute file names (/usr/bin/apache), binaries (gprof) or shared libraries (libXm.so.2) in standard path. It does not support multiple arguments yet...
The System and Arch are optional added filters, for example System could be "redhat", "redhat-7.2", "mandrake" or "gnome", Arch could be "i386" or "src", etc. depending on your system.
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 i'th worker to the j'th 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. This particular implementation is based on http://csclab.murraystate.edu/~bob.pilgrim/445/munkres.html.
| Package | Summary | Distribution | Download |
| python313-munkres-1.1.4-4.10.noarch.html | Munkres implementation for Python | OpenSuSE Tumbleweed for noarch | python313-munkres-1.1.4-4.10.noarch.rpm |
| Munkres implementation for Python | python313-munkres-1.1.4-4.10.noarch.rpm | ||
| python313-munkres-1.1.4-4.9.noarch.html | Munkres implementation for Python | OpenSuSE Tumbleweed for noarch | python313-munkres-1.1.4-4.9.noarch.rpm |
| python313-munkres-1.1.4-4.6.noarch.html | Munkres implementation for Python | OpenSuSE Ports Tumbleweed for noarch | python313-munkres-1.1.4-4.6.noarch.rpm |
Generated by rpm2html 1.6