This is a JavaScript implementation of the Hungarian/Munkres algorithm for solving the assignment problem in polynomial time.
-
Notifications
You must be signed in to change notification settings - Fork 0
The Hungarian algorithm solves the assignment problem in polynomial time. Also known as: Munkres algorithm.
brian-gates/hungarian
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The Hungarian algorithm solves the assignment problem in polynomial time. Also known as: Munkres algorithm.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published