Prim's Algorithm [GSSOC'23]

[atumat]

Describe the project you want to add with tech stack
Prim's algorithm finds the subset of edges that includes every vertex of the graph such that the sum of the weights of the edges can be minimized.
Tech Stack : C

Expected behavior
Prim's algorithm starts with the single node and explores all the adjacent nodes with all the connecting edges at every step. The edges with the minimal weights causing no cycles in the graph got selected.

Screenshots (optional)

Additional context (optional )

[atumat]

@MohitGupta121 @TusharKesarwani @pranjay-poddar Please assign me this issue under gssoc'23.