JuliaGraphs / JuliaGraphs/Graphs.jl
Consistent approach to graph direction
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 538
- Forks
- 128
- Avg merge
- 10h 25m
- Merged PRs (30d)
- 2
Description
In traversals we use dir=[:in,:out] to tell functions to use in or out neighbors. We should probably have a more systematic approach based on a type like ReverseGraph{G} <: AbstractGraph. This came up in #36 where you have a symmetry in the algorithm that is invariant to the direction.
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 reading src/traversals/bfs.jl and the existing dir=[:in,:out] handling, then review the symmetry discussed in issue #36. Compare the traversal APIs and determine the scope for a consistent direction abstraction such as ReverseGraph{G} <: AbstractGraph; done means the approach and affected algorithms are clearly defined and consistently supported.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- data
- Issue type
- Refactor
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100