JuliaGraphs / JuliaGraphs/GraphsOptim.jl
Package roadmap
Open
Nobody has claimed this yet.
enhancement
good first issue
- Dominant language
- Julia
- Stars
- 22
- Forks
- 8
- PR merge metrics
- No merged PRs in 30d
Description
Polynomial problems
- shortest path
- flow
- assignment / matching
- spanning tree
NP-hard problems
- coloring
- fractional coloring (see #5)
- vertex / edge cover
- maximum clique / independent set
- traveling salesperson
- graph isomorphism
See also:
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
This is a roadmap rather than a scoped implementation task. Review the unchecked polynomial and NP-hard problems, including the related issues #5 and Graphs.jl #108, then choose a specific algorithm only after its scope and entry point are defined. Done would require a separately specified implementation and completion criteria.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100