SlackBuilds Repository

14.1 > Libraries > munkres (1.0.6)

The Munkres module provides an 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
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.

If you want to build this for use with Python 3.x (needs the
optional dependency python3) pass the script PYTHON3=yes, like

PYTHON3=yes ./munkres.SlackBuild

Maintained by: Dimitris Zlatanidis
Keywords: algorithm,python,assignment

Homepage:
http://software.clapper.org/munkres/

Source Downloads:
munkres-1.0.6.tar.gz (d7ba3b8c5001578ae229a2d5a655872f)

Download SlackBuild:
munkres.tar.gz
munkres.tar.gz.asc (FAQ)

(the SlackBuild does not include the source)

Individual Files:
README
munkres.SlackBuild
munkres.info
slack-desc

See our HOWTO for instructions on how to use the contents of this repository.

Access to the repository is available via:
ftp git cgit http rsync

[  Exec: 0.03 sec  |  Load: 0.08 0.07 0.05  ]

© 2006-2014 SlackBuilds.org Project. All rights reserved.
Slackware® is a registered trademark of Patrick Volkerding
Linux® is a registered trademark of Linus Torvalds
Web Design by WebSight Designs |  Managed Hosting by OnyxLight Communications