github-actions[bot]
commented
2 hours ago @Keyur2311
Welcome to the Project!
Thank you for opening this Issue 🙌! We’re thrilled to have you join us for Hacktoberfest 💖. We’ll review your submission and get back to you shortly.
In the meantime, please remember to give this repo a star! ⭐ We appreciate your contribution!
Hey @Kushal997-das , I propose adding an implementation of Kruskal's Algorithm in C++ to find the minimum spanning tree of a connected, undirected graph. The output will contain the edges and the cost of minimum spanning tree built with Krushal's algorithm.
Input: 1 5 7 0 1 10 0 2 6 0 3 5 1 3 15 2 3 4 1 2 8 2 4 3
Output: Edegs in MST are :- 2 -> 4 0 -> 3 0 -> 1 Total cost of MST is : 18
can you please assign me this issue? Thank You.