WARNING: THIS SITE IS A MIRROR OF GITHUB.COM / IT CANNOT LOGIN OR REGISTER ACCOUNTS / THE CONTENTS ARE PROVIDED AS-IS / THIS SITE ASSUMES NO RESPONSIBILITY FOR ANY DISPLAYED CONTENT OR LINKS / IF YOU FOUND SOMETHING MAY NOT GOOD FOR EVERYONE, CONTACT ADMIN AT ilovescratch@foxmail.com
Skip to content

oddg/hungarian-algorithm

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Hungarian Algorithm

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

Usage

package main

import (
	"fmt"
	"github.com/oddg/hungarian-algorithm"
)

func main() {
	a := [][]int{{11, 6, 12}, {12, 4, 6}, {8, 12, 11}}
	fmt.Println(hungarianAlgorithm.Solve(a))
}

License

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

About

A Go implementation of the Hungarian algorithm

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages