# Assignment

[![License BSD3](https://img.shields.io/badge/license-BSD3-brightgreen.svg)](http://opensource.org/licenses/BSD-3-Clause)
[![Hackage](https://img.shields.io/hackage/v/assignment.svg?style=flat)](https://hackage.haskell.org/package/assignment)
[![Stackage Nightly](http://stackage.org/package/assignment/badge/nightly)](http://stackage.org/nightly/package/assignment)
[![Stackage LTS](http://stackage.org/package/assignment/badge/lts)](http://stackage.org/lts/package/assignment)
[![CI](https://github.com/mrkkrp/assignment/actions/workflows/ci.yaml/badge.svg)](https://github.com/mrkkrp/assignment/actions/workflows/ci.yaml)

This package implements a solution to the [assignment problem][problem]. It
follows the [matrix interpretation][matrix-interpretation] of the so-called
Hungarian algorithm and works in *O(n^4)*.

[problem]: https://en.wikipedia.org/wiki/Assignment_problem
[matrix-interpretation]: https://en.wikipedia.org/wiki/Hungarian_algorithm#Matrix_interpretation

## Contribution

Issues, bugs, and questions may be reported in [the GitHub issue tracker for
this project](https://github.com/mrkkrp/assignment/issues).

Pull requests are also welcome.

## License

Copyright © 2024–present Mark Karpov

Distributed under BSD 3 clause license.