AlgoGenesis is a centralized open-source platform dedicated to providing optimized and well-documented algorithm implementations in C. Perfect for both beginners and advanced users, this repository serves as a comprehensive learning resource for solving algorithmic challenges.
MIT License
8
stars
19
forks
source link
Prim's Algorithm for Minimum Spanning Tree (MST) #52
Prim's Algorithm is a greedy algorithm used to find the minimum spanning tree (MST) of a connected, undirected graph. The minimum spanning tree is a subset of edges that connects all vertices in the graph with the minimum possible total edge weight, without forming any cycles.
@pankaj-bind I will add code in C with with proper explanation.
Please assign it to me under the label of gssoc-ext, hacktoberfest and required
level .
Charul00
commented
2 hours ago
Description:
Prim's Algorithm is a greedy algorithm used to find the minimum spanning tree (MST) of a connected, undirected graph. The minimum spanning tree is a subset of edges that connects all vertices in the graph with the minimum possible total edge weight, without forming any cycles.
@pankaj-bind I will add code in C with with proper explanation.
Please assign it to me under the label of gssoc-ext, hacktoberfest and required level .