Implement minimum-cost spanning Tree using Kruskal Algoritm.

[thepritam]

Can I take this @mayank64ce

[thepritam]

I will implement it using disjoint set data structure.

[thepritam]

Can I work on this @s-ayush2903

[s-ayush2903]

Please finish your previous issue first and we'll be glad to assign you this

[omega07]

I'd like to work on this.

[s-ayush2903]

@omega07 This issue is awaiting @thepritam because they asked first, so can you please find/create a different issue for yourself, we have plenty of 'em

[sanchit000]

Can you please assign this issue to me? I would love to work on it.

[princekalra]

hey can i contribute on this

[s-ayush2903]

Let me first take author's consent as they asked first to work on it. @thepritam Are you still interested in working on this issue?

SideNote: If I don't get any response from @thepritam in 5hrs. then I'll assign it to anyone one of @omega07 @sanchit000 @princekalra whoever wants to work on this issue, if they all are interested then the issue will be assigned to the person who asked first to work on it.

[thepritam]

Yes , I will work on this issue. Please assign this to me.

[princekalra]

Let me first take author's consent as they asked first to work on it. @thepritam Are you still interested in working on this issue?

SideNote: If I don't get any response from @thepritam in 5hrs. then I'll assign it to anyone one of @omega07 @sanchit000 @princekalra whoever wants to work on this issue, if they all are interested then the issue will be assigned to the person who asked first to work on it.

yes i want to work on this please assign it to me

[stale]

It will be now be reviewed manually. Thanks for contributions. If you have more concerns, you may get the conversation started at our discord server