Skip to content

aluxian/Assignment-Problem-Weighted-Bipartite-Matching

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Assignment Problem (Weighted Bipartite Matching)

A solution for the assignment problem using the Hungarian Algorithm on weighted bipartite graphs.

Available as an API on Algorithmia.

About

Assignment Problem (Weighted Bipartite Matching)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages