williamfiset / williamfiset/algorithms
Add New graphtheory Algorithm - Hungarian algorithm in Java
Nobody has claimed this yet.
- Dominant language
- Java
- Stars
- 18.8k
- Forks
- 4.5k
- PR merge metrics
- No merged PRs in 30d
Description
The Hungarian algorithm is mainly used to solve some problems related to bipartite graph matching.The code I uploaded mainly addresses the issue of minimum point coverage, and I hope it will be helpful
Kindly to ask if there is somebody working for this issue? If not ,I'm glad to undertake it.
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
The issue requests a Java implementation of the Hungarian algorithm for bipartite matching and minimum point coverage. Start by locating the repository's Java graph-theory algorithm area and reviewing its contribution conventions. Done means the algorithm is added in the appropriate location and addresses the stated minimum point coverage use case.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- java
- Domain
- data
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100