williamfiset / williamfiset/algorithms
Add New graphtheory Algorithm - Hungarian algorithm in Java
Open
Nobody has claimed this yet.
- Dominant language
- Java
- Stars
- 18.8k
- Forks
- 4.5k
- PR merge metrics
- No merged PRs in 30d
Description
I think adding a new graphtheory algorithm is useful. The Hungarian algorithm is a good solution for bipartite graph matching problems
Contributor guide
No contributing guide indexed for this repository
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
No file, test, or entry point is named in the issue. Start by surveying the repository's existing Java graph-theory algorithms and their tests, then determine where a Hungarian algorithm implementation belongs. Done means the algorithm is added consistently with those conventions and its behavior is covered by appropriate tests.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- java
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100