Skip to content
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.

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

Implementation of Krushals Min Cost Spanning Tree Function in C++ #6586

Open
1 of 3 tasks
Shivanisingh1809 opened this issue Oct 11, 2022 · 7 comments
Open
1 of 3 tasks

Comments

@Shivanisingh1809
Copy link
Contributor

Shivanisingh1809 commented Oct 11, 2022

This is O(n logn) :

  • New algorithm
  • Update to an existing algorithm
  • Error
  • [x ] Proposal to the Repository

Details:

@Shivanisingh1809
Copy link
Contributor Author

Please verify and merge my pull request for hacktoberfest

@Shivanisingh1809
Copy link
Contributor Author

@AdiChat please review and accept my PR for hacktoberfest

@ujjwalshivhare
Copy link

hello mam,
can you please assign me this issue

@rajbhoyar729
Copy link

hi mam i will do it in most optimized way plz assign it to me plz

@rajbhoyar729
Copy link

can you plz assigne it to me mam
i will love to work on it

@Shivanisingh1809
Copy link
Contributor Author

Hi @ujjwalshivhare you can assign it to yourself and work on it

@PrathamKumar125
Copy link

@AdiChat @Shivanisingh1809 please review the merged code.

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

No branches or pull requests

5 participants