JuliaGraphs / JuliaGraphs/Graphs.jl
[Port] Add widest / maximum capacity path algorithm
Open
Nobody has claimed this yet.
enhancement
- Dominant language
- Julia
- Stars
- 538
- Forks
- 128
- Avg merge
- 10h 25m
- Merged PRs (30d)
- 2
Description
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 the linked LightGraphs.jl issue 1557, since this issue provides no local files, tests, or entry point. Use that issue to determine the required widest or maximum-capacity path behavior and identify how completion should be validated in Graphs.jl.
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
- Needs clarification
- Newbie friendliness
- 25/100