assignment-problem topic
graph-theory
A simple graph library
hungarian-algorithm
(Kuhn-Munkres) numpy implementation, rectangular matrix is supported (|X| <= |Y|). 100x100000 in 0.153 s.
Hungarian.jl
The Hungarian(Kuhn-Munkres) algorithm for Julia
Elzero-Cpp-Assignments
All C++ Solutions Of Elzero Web School Channel Assignments and elzero.org Website Assignments
Learn-Js
Elzero Web School Js Course Assignments Solutions
Learn-CSS
Elzero Web School CSS Course Assignments Solutions
Fast-Partial-Tracking
Fast partial tracking of audio with real-time capability through linear programming. Hungarian algorithm provides optimal spectral peak-to-peak matching in polynomial time.
pointgrid
Transform a 2D point distribution to a hex grid to avoid overplotting in data visualizations
OperationsResearchModels.jl
A Julia package for operations research subjects
hungarian-net
Deep-learning-based implementation of the popular Hungarian algorithm that helps solve the assignment problem.