coordinate API with GraphOptim and move JuMP-dependent functionality there
Nobody has claimed this yet.
Assessment
- Difficulty
- 5/5
- Estimated time
- Over a week
- Newbie friendliness
- 28/100
- Issue type
- Refactor
- Clarity
- Mostly clear
- Activity status
- Stale
- Tech stack
- julia
- Domain
- backend-api-design
Research direction
Compare the matching functionality with GraphOptim, including GraphOptim.min_cost_assignment, and review the MatchingResult types in both libraries. Check how the Hungarian and Blossom-based functions relate to BipartiteMatching.jl; done means the JuMP-dependent functions, return types, and APIs are consistently coordinated across the libraries.
Written by the indexing model from the issue text.
Description
If I understand correctly, GraphOptim exists as a home for all graph algorithms that require a MILP tool like JuMP.
In which case:
- the maximum/minimum perfect match functions based on the Blossom algorithm should probably stay here
- the maximum/minimum weight match (not perfect) that use the Hungarian algorithm and require JuMP should probably moved to GraphOptim
- the
MatchingResultreturn type should be synchronized between the two libraries
Also need to be consistent with GraphOptim.min_cost_assignment and BipartiteMatching.jl
- Dominant language
- Julia
- Stars
- 20
- Forks
- 8
- PR merge metrics
- No merged PRs in 30d
Getting set up
This project ships no dev container, Dockerfile or contributing guide, so setting up is up to you: start from its README, and see our first-contribution guide for the general steps.
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
More from JuliaGraphs/GraphsMatching.jl
-
Difficulty 3/5 1-2 days Newbie friendliness 45/100
-
[BUG] different JuMP optimizers give different results in `maximum_weight_matching`May be free again @Krastanov claimed this 483 days ago, and no pull request is open. Openbug
JuliaGraphs/GraphsMatching.jl#24 · 1 assignee ·
-
Difficulty 5/5 Over a week Newbie friendliness 25/100
JuliaGraphs/GraphsMatching.jl#14 · 27 comments · 4 reactions ·
-
Segfault in `maximum_weight_perfect_matching` when the graph does not have a perfect matchingPossibly taken @etiennedeg claimed this 920 days ago. Open
Difficulty 4/5 3-5 days Newbie friendliness 25/100
-
Difficulty 3/5 1-2 days Newbie friendliness 35/100
JuliaGraphs/GraphsMatching.jl#7 · 4 comments ·
All issues in JuliaGraphs/GraphsMatching.jl
Similar issues
-
Difficulty 2/5 1-3 hours Newbie friendliness 84/100
Maintainers usually reply within 1 day
-
Difficulty 1/5 1-3 hours Newbie friendliness 86/100
-
Difficulty 2/5 1-3 hours Newbie friendliness 70/100
FluxML/Metalhead.jl#407 ·
Maintainers usually reply within 1 day
-
Difficulty 2/5 1-3 hours Newbie friendliness 62/100
-
Difficulty 1/5 Under an hour Newbie friendliness 88/100
SciML/ModelingToolkit.jl#5371 ·
Maintainers usually reply within 2 days