Kruskal algorithm in JAVA
chaitanyakatore opened this issue · comments
Information about Algorithm
Kruskal Algorithm (KA), KA finds the minimum-spanning-tree, which means, the group of edges with the minimum sum of their weights that connect the whole graph.
Have you read the Contributing.md and Code of conduct
- Yes
- No
Other context
This algorithm GeeksforGeeks problem and asked in many companies
Thanks for opening your first issue here! Be sure to follow the issue template!
make this issue under hacktoberfest I am making PR for it
I would like to work on this
I can contribute to this. Please assign this to me