hakowork/rojo
3
0
Fork 0
mirror of https://github.com/rojo-rbx/rojo.git synced 2026-10-23 05:51:39 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

feat: implement optimal assignment using Hungarian algorithm in matching process

Browse source 
- Added a new function for minimum-cost bipartite matching via the Hungarian algorithm to improve the efficiency of the matching process.
- Refactored existing matching logic to utilize the new algorithm, replacing the previous greedy assignment approach.
- Updated relevant documentation to reflect changes in the matching strategy.
- Enhanced performance in ambiguous group matching scenarios.
This commit is contained in:
Joe 2026-03-07 17:55:50 -06:00
parent 43ede3bc0e
commit d26f82b4f2
6 changed files with 414 additions and 151 deletions
Download patch file Download diff file Expand all files Collapse all files

2
Cargo.toml
View file

@ -113,6 +113,7 @@ dirs = "6"
pathdiff = "0.2.3"
blake3 = "1.8.3"
rand = "0.10.0"
sha1 = "0.10"
indexmap = { version = "2.13.0", features = ["serde"] }
@ -144,4 +145,3 @@ regex = "1"
serde_yaml = "0.9"
tempfile = "3"
walkdir = "2.5.0"
rand = "0.10.0"