JuliaGraphs / JuliaGraphs/Graphs.jl
BFS question for directed graph
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 538
- Forks
- 128
- Avg merge
- 10h 25m
- Merged PRs (30d)
- 2
Description
Is there a way to run a BFS search on a directed graph, but traversing edges in either direction (essentially treating it as an undirected graph)? My use case is that the directions on edges are more like edge orientations than traversal limitations - they indicate the meaning of positive or negative flow on that edge, but are otherwise unimportant to adjacency.
Also, would it be possible to add an example or two of doing a BFS (and/or DFS) traversal on a graph? I'm not quite seeing how to use the bfs_parents and bfs_tree methods in practice.
Thanks.
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 examining the existing bfs_parents and bfs_tree APIs and any current BFS or DFS examples in the Graphs.jl documentation. Clarify whether directed-edge traversal in both directions belongs in the BFS interface, then define completion as documented practical traversal examples and an agreed behavior for the requested adjacency semantics.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- data
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100