JuliaGraphs / JuliaGraphs/Graphs.jl
Coherent return types for Kruskal vs Prim
Open
enhancement
- Dominant language
- Julia
- Stars
- 538
- Forks
- 128
- Avg merge
- 10h 25m
- Merged PRs (30d)
- 2
Description
See https://github.com/JuliaGraphs/SimpleWeightedGraphs.jl/issues/17
When applied on a SimpleWeightedGraphs, one function returns a vector of Edge, the other a vector of SimpleWeightedEdge
Related discussion on Graphs.jl:
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 reading SimpleWeightedGraphs.jl issue 17 and the related Graphs.jl pull requests 116 and 125. Compare the Kruskal and Prim results when applied to a SimpleWeightedGraphs graph; the work is done when both algorithms return coherent edge types, with the expected behavior aligned with the existing discussion and open pull request 172.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- data
- Issue type
- Refactor
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 25/100