munkres 0.4.0

Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem with O(n^3) time complexity
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13

# munkres-rs [![Build Status][travis-image]][travis-link]

[travis-image]: https://travis-ci.org/mneumann/munkres-rs.svg?branch=master
[travis-link]: https://travis-ci.org/mneumann/munkres-rs

Kuhn-Munkres (aka Hungarian) algorithm for solving the Assignment Problem
written in Rust. Time complexity is O(n^3).

This is a modified port from https://github.com/bmc/munkres.

## TODO

* Implement SIMD f32x4 weight matrix