[FEATURE REQUEST] <title>Add new algorithm under Graph algorithms Edmonds

[dinesh15]

What would you like to Propose?

I would like to propose the addition of the Edmonds' Algorithm to the repository. Edmonds' algorithm, also known as the Maximum Weight Matching algorithm for general graphs, is highly useful in graph theory for solving problems involving matching in graphs. I have implemented this algorithm in a scalable and optimized way, which I believe will enhance the algorithmic coverage of the repository and provide value for users working on graph-based problems.

Issue details

The repository currently lacks an implementation of Edmonds' Algorithm. My implementation includes:

Finding maximum weight matching in a general (possibly non-bipartite) graph. Handling weighted and unweighted graphs. Efficiency improvements over a naïve approach by reducing the time complexity.

Additional Information

No response

[siriak]

Sounds great, feel free to add it!

[dinesh15]

Sure Will Do

[wxm2004]

Thank you for your proposal! Edmonds' Algorithm would indeed be a great addition to the repository and would expand the algorithmic coverage significantly. I can help review your implementation to ensure it meets the repository’s code standards and performance requirements. If needed, I can assist with writing or improving the documentation to help other developers understand and use the algorithm effectively. I look forward to collaborating with you and contributing to this issue.

[ionuthodoroaga03]

I can work on this if that's ok. :)

[dinesh15]

I was still working on it. we can collaborate if you want.

[ionuthodoroaga03]

Sure, how can I help?

[Brijeshthummar02]

Guys i've already pulled a request so wait for the review.

[github-actions[bot]]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!

[github-actions[bot]]

Please reopen this issue once you have made the required changes. If you need help, feel free to ask in our Discord server or ping one of the maintainers here. Thank you for your contribution!