JuliaGraphs / JuliaGraphs/GraphsMatching.jl
coordinate API with GraphOptim and move JuMP-dependent functionality there
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 20
- Forks
- 8
- Avg merge
- 9h 15m
- Merged PRs (30d)
- 1
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
Contributor guide
No contributing guide indexed for this repository
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.
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.
Assessment
- Tech stack
- julia
- Domain
- backend-api-design
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 28/100