Prim's Algorithm in C++

[Okayd123]

Information about Algorithm

Finds the minimum spanning tree of a graph by a greedy algorithm. It takes two sets of vertices, those in the MST and those not in the MST. It repeatedly finds the edges connecting the two sets of vertices and adds the one with the lowest weight to the MST.

Have you read the Contributing.md and Code of conduct

• [x] Yes
• [ ] No

Other context

This is my first ever open-source contribution and is also done as part of a project for a college course.

[welcome[bot]]

Thanks for opening your first issue here! Be sure to follow the issue template!

[Mudit-Jxin7]

Hi I would like to contribute to this issue if anyone else is not working on it

[aryashsaxena]

Hi I'm interested to solve this type of issue. Can you assign me this issue ? I would like to contribute to this issue.