onlinematching
v0.3.2crates.io· RustOnline 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.
The verdict
Abandoned. Last published 2 years ago. No recent activity — look for a maintained alternative.
No recent activity — look for a maintained alternative.
Live from the crates.io registry · derived rules, not AI
How it scores
MaintenanceAbandoned
PopularityNiche
SecurityClean
LicensePermissive
DepsZero deps
Maintenance
Last published 2 years ago.
Popularity
1 downloads / week
Security
No known advisories for this version (OSV).
License
MIT
Dependencies
No runtime dependencies
Recent releases
- 0.3.22 years ago
- 0.3.13 years ago
- 0.3.03 years ago
- 0.2.53 years ago
- 0.2.13 years ago
- 0.1.33 years ago
- 0.1.13 years ago
- 0.1.03 years ago