[Code Addition Request]: Add MST Algorithms

[shashmitha46]

Have you completed your first issue?

• [ ] I have completed my first issue

Guidelines

• [X] I have read the guidelines
• [ ] I have the link to my latest merged PR

Latest Merged PR Link

N/A

Project Description

Add implementations of Prim's and Kruskal's algorithms for finding the Minimum Spanning Tree (MST) in an undirected, weighted graph. Both algorithms should be optimized for performance, with Prim's using a priority queue and Kruskal's utilizing a disjoint set for cycle detection. Include clear comments, unit tests, and handle edge cases like disconnected graphs. This addition will enhance the repository’s graph algorithms section

Full Name

Shashmitha V

Participant Role

GSSOC

[github-actions[bot]]

🙌 Thank you for bringing this issue to our attention! We appreciate your input and will investigate it as soon as possible.

Feel free to join our community on Discord to discuss more!

[shashmitha46]

completed

[UTSAVS26]

@shashmitha46 please create a New PR and fill all the details that are asked. It will help reviewers to verify it.

[github-actions[bot]]

✅ This issue has been closed. Thank you for your contribution! If you have any further questions or issues, feel free to join our community on Discord to discuss more!