Crates.io | onlinematching |
lib.rs | onlinematching |
version | 0.3.2 |
source | src |
created_at | 2022-09-14 12:37:58.213246 |
updated_at | 2023-08-20 16:06:38.445518 |
description | 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. |
homepage | |
repository | |
max_upload_size | |
id | 665746 |
size | 44,309 |