JuliaGraphs / JuliaGraphs/Graphs.jl
Feature Request: Iterator for Graph Traversal
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 538
- Forks
- 128
- Avg merge
- 10h 25m
- Merged PRs (30d)
- 2
Description
For some algorithms, it is needed to visit each node and perhaps do some work there and then move on, in other words iterate through them. I implemented this myself (although a rough approach) so I just wanted to open an issue and see if this would be a welcomed addition before I clean up my code and adhere to the contribution guidelines / style.
An example of a need for this is orienting normals on a surface, see Surface Reconstruction from Unorganized Points section 3.3.
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
The issue names no files or tests. Start by clarifying the iterator's traversal behavior and API against the stated surface-normal use case, then review the contribution guidelines and style. Done should be an accepted iterator addition with coverage showing that each node can be visited.
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