Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Introduce unweighted bipartite matching problem #6

Closed
rluce opened this issue Jun 29, 2022 · 3 comments
Closed

Introduce unweighted bipartite matching problem #6

rluce opened this issue Jun 29, 2022 · 3 comments
Assignees

Comments

@rluce
Copy link
Member

rluce commented Jun 29, 2022

  • Input sparse graph / matrix (whatever scikit learn uses)
  • Pics
@simonbowly simonbowly self-assigned this Jul 15, 2022
@rluce rluce transferred this issue from another repository Nov 22, 2022
@rluce
Copy link
Member Author

rluce commented May 3, 2023

Where are we standing on this mod? The current look and feel is a lot like work in progress...

  • It goes by the name "Maximum Weighted Matching" but we still restrict it to bipartite
  • Documentation has boiler plate text blocks in it

Is the plan to polish it up to a proper mod, or to shelve it ?

@simonbowly simonbowly changed the title Introduce bipartite matching problem in "Graph problems" category Introduce unweighted bipartite matching problem May 4, 2023
@simonbowly
Copy link
Member

Unweighted bipartite matching is almost done (I have a branch still to merge). General weighted matching (#12) is far from complete, might shelve it for the first release since we have plenty of graph mods.

@simonbowly simonbowly added this to the First public release milestone May 8, 2023
@simonbowly
Copy link
Member

This is done, closing

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants