add Karger's Algorithm for partitioning a graph.
Open
Nobody has claimed this yet.
core
development
enhancement
good first issue
hacktoberfest
- Dominant language
- C++
- Stars
- 729
- Forks
- 147
- Avg merge
- 19h
- Merged PRs (30d)
- 1
Description
Please add An implementation of Karger's Algorithm for partitioning a 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
The issue names no files, tests, or entry points; begin by locating the existing graph algorithm implementations and determining where a Karger's Algorithm implementation belongs. Define the expected graph-partitioning behavior and add validation for it before considering the issue done.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- data
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100