New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Add New graphtheory Algorithm - Hungarian algorithm in Java #404

Open

hunter129143 opened this issue Oct 7, 2023 · 1 comment

hunter129143 commented Oct 7, 2023

I think adding a new graphtheory algorithm is useful. The Hungarian algorithm is a good solution for bipartite graph matching problems

Author

hunter129143 commented Oct 7, 2023

The Hungarian algorithm can also be used in multi-agent collaboration for target allocation, with remarkable effectiveness

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment