onlinematching 0.3.2

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.
Documentation
  • Feature flags
  • This release does not have any feature flags.

onlinematching

There is very little structured metadata to build this page from currently. You should check the main library docs, readme, or Cargo.toml in case the author documented the features in them.

This release does not have any feature flags.