JuliaGraphs / JuliaGraphs/Graphs.jl
Edmonds' algorithm
Nobody has claimed this yet.
- Dominant language
- Julia
- Stars
- 538
- Forks
- 128
- Avg merge
- 10h 25m
- Merged PRs (30d)
- 2
Description
Graphs.jl currently has three spanning trees algorithms (https://juliagraphs.org/Graphs.jl/dev/algorithms/spanningtrees/):
It would be nice to also have the Chu–Liu/Edmonds' algorithm for the minimum spanning arborescence (i.e. Directed MST). The best approach seems to be this one https://doi.org/10.1007/BF02579168 from Gabow, Galil, Spencer, and Tarjan.
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 with the spanning-trees documentation and the existing Boruvka, Kruskal, and Prim implementations to understand the project's conventions. Read the linked Chu–Liu/Edmonds algorithm description and the Gabow, Galil, Spencer, and Tarjan paper. Done means Graphs.jl provides and documents a tested minimum spanning arborescence implementation.
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
- Mostly clear
- Newbie friendliness
- 35/100