JuliaGraphs / JuliaGraphs/GraphsOptim.jl
Compare with networkx
Open
Nobody has claimed this yet.
enhancement
- Dominant language
- Julia
- Stars
- 22
- Forks
- 8
- PR merge metrics
- No merged PRs in 30d
Description
It would be fairly easy to test our algorithms by comparing their output with the networkx equivalent
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 identifying the graph optimization algorithms in GraphsOptim.jl and the corresponding NetworkX implementations; the issue names no files or test entry points. Determine which algorithm outputs should be compared, then add comparison coverage and verify that the Julia results match the NetworkX equivalents.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- testing
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 35/100