JuliaGraphs / JuliaGraphs/Graphs.jl
Shortest path for direct acyclic graphs (DAG)
Open
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 538
- Forks
- 128
- Avg merge
- 10h 25m
- Merged PRs (30d)
- 2
Description
Having the longest path algorithm for directed acyclic graphs means that we also have the shortest path algorithm for DAG.
function dag_shortest_path( g::::IsDirected, distmx::AbstractMatrix=weights(g); topological_order=topological_sort_by_dfs(g), ) = dag_longest_path( g, -distmx; topological_order )
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
Search for dag_longest_path and topological_sort_by_dfs to find the existing DAG path implementation and its tests. Add the shortest-path entry point described in the issue, check its behavior with weighted DAGs, and extend the relevant tests so the new function’s results are verified.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- data
- Issue type
- Feature
- Difficulty
- 2/5
- Estimated time
- 1-3 hours
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 58/100