JuliaGraphs / JuliaGraphs/Graphs.jl
"Undirected" mode for shortest paths with directed graphs
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 538
- Forks
- 128
- Avg merge
- 10h 25m
- Merged PRs (30d)
- 2
Description
This is a repost of this issue on the old repo.
Hi,
This is a follow up of this discussion.
Is there a way to efficiently find shortest paths in a directed graph while ignoring the direction of the edges ? (so without casting to a directed graph)
R seems to have an "undirected" mode for this.
Having thought more on this, better than a keyword in functions, it would be practical to have a new graph type that would be a wrapper around a directed graph, with redefinition of accessers to make it an undirected graph (a sort of graph view). This would avoid the heavy conversion to an undirected graph.
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 reviewing the graph accessor APIs and shortest-path functions involved in directed graphs. Determine how a graph-view type could expose directed edges as undirected without converting the graph, then verify that shortest-path calls accept the view and preserve expected behavior. Done means the wrapper works for the requested use case without heavy conversion.
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