Kruskal's Algo in Graphs Folder

[vaishvi2811]

Feature description

The repository's Graph folder can be expanded to include popular greedy graph algorithm, Kruskal's Algorithm.
I'm participating in Hacktober fest, please assign this to me.

[Smriti-Prajapati]

Hey I am participating in Hactoferbest , could you please assign this issue to me.

[rj-Anurag]

/assign

[Smriti-Prajapati]

I updated the code , check it and if it's correct , please merge it so that my tasks can be completed.

…

On Mon, 14 Oct 2024, 12:05 am Anurag, ***@***.***> wrote: /assign — Reply to this email directly, view it on GitHub <#12020 (comment)>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/BCGCG5TJBPEVG4QG3LGYPKTZ3K4PLAVCNFSM6AAAAABP2XHSKOVHI2DSMVQWIX3LMV43OSLTON2WKQ3PNVWWK3TUHMZDIMBZGA4DAMRVGY> . You are receiving this because you commented.Message ID: ***@***.***>

[tianyizheng02]

We already have multiple implementations of Kruskal's algorithm: https://github.com/search?q=repo%3ATheAlgorithms%2FPython%20kruskal&type=code

Also, please do not create issues to propose new algorithms. This has already been said in our contributing guidelines, which you have hopefully already read:

If you are interested in resolving an open issue, simply make a pull request with your proposed fix. We do not assign issues in this repo so please do not ask for permission to work on an issue.

Do not create an issue to contribute an algorithm. Please submit a pull request instead.

In this case, it's not a new algorithm, but in any case contributors should do their own due diligence to confirm that their proposed algorithms haven't already been implemented.