onlinematching
Online bipartite matching is a type of matching problem where the goal is to match elements from two disjoint sets (also known as "bipartite graphs"), where one set represents the "left" vertices and the other set represents the "right" vertices.
Ecosystem
crates.io
crates.io
Latest Release
over 2 years ago
0.3.2
over 2 years ago
Versions
8
8
Downloads
9,961 total
9,961 total
Loading...
Readme
Loading...
Links
| Registry | crates.io |
| Docs | Documentation |
| JSON API | View JSON |
| CodeMeta | codemeta.json |
Package Details
| PURL |
pkg:cargo/onlinematching
spec |
| License | MIT |
| First Release | over 3 years ago |
| Last Synced | 9 days ago |