JuliaGraphs / JuliaGraphs/Graphs.jl
Move code from GraphsFlows and GraphsMatching to Graphs
Open
Nobody has claimed this yet.
enhancement
good first issue
help wanted
- Dominant language
- Julia
- Stars
- 538
- Forks
- 128
- Avg merge
- 10h 25m
- Merged PRs (30d)
- 2
Description
The LP-based algorithms of both packages are being migrated to GraphsOptim, but the combinatorial algorithms (with minimal dependencies) could and should probably go into the main library
See also #108
Contributor guide
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
Start by reviewing the combinatorial algorithms in GraphsFlows and GraphsMatching, then read issue #108 for related context. Identify which algorithms have minimal dependencies and can move into the main Graphs library, while LP-based algorithms continue migrating to GraphsOptim. Done means the intended combinatorial code has been relocated without retaining unnecessary package dependencies.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- data
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100