 | Munkres-0.1: Munkres' assignment algorithm (hungarian method) | Contents | Index |
 Data | |||||||||||
| |||||||||||
| |||||||||||||||
| Munkres-0.1: Munkres' assignment algorithm (hungarian method) | |||||||||||||||
| The Munkres algorithm solves the weighted minimum matching problem in a complete bipartite graph, in O(n^3) time. This problem is often called the 'assignment problem'. See eg. http://en.wikipedia.org/wiki/Hungarian_algorithm. | |||||||||||||||
| Modules | |||||||||||||||
| |||||||||||||||
| Produced by Haddock version 2.4.1 | |||||||||||||||