assignment

README

Hungarian Algorithm

Forked from: https://github.com/oddg/hungarian-algorithm

An implementation of the Hungarian Algorithm for solving the assignment problem. The implementation follows those notes and runs in O(n^3).

Documentation

See godoc.

License

This project is under the MIT License. See the LICENSE file for the full license text.

Documentation

Index

• func Solve(n int, costs []float64) []int
• func SolveMax(n int, costs []float64) []int

Examples

• Solve

Functions

func Solve

func Solve(n int, costs []float64) []int

Solve returns the solution as a slice `a` such that each row `i` is matched to column `a[i]`.

Example

a := []weight{
	11, 6, 12,
	12, 4, 6,
	8, 12, 11,
}
fmt.Println(Solve(3, a))

Output:
[1 2 0]

func SolveMax

func SolveMax(n int, costs []float64) []int

SolveMax returns a maximum solution. NOTE: currently this modifies the costs in-place.