This repository is for beginners who want to contribution in open source Hacktoberfest 2024.This project is designed to promote learning and growth in the field of software development. It offers a range of coding challenges and projects that cover various topics, from basic algorithms to complex application development.
Apache License 2.0
83
stars
536
forks
source link
Implement Kruskal's Algorithm for Minimum Spanning Tree #55
Implement Kruskal's Algorithm to find the Minimum Spanning Tree (MST) for a connected, undirected graph using C++. The algorithm should take input as the number of vertices, edges, and edge weights and output the minimum spanning tree and its total weight. This issue requires knowledge of graph theory and disjoint-set data structures (Union-Find).
Please assign this issue to me under Hacktoberfest 2024 label :)
Implement Kruskal's Algorithm to find the Minimum Spanning Tree (MST) for a connected, undirected graph using C++. The algorithm should take input as the number of vertices, edges, and edge weights and output the minimum spanning tree and its total weight. This issue requires knowledge of graph theory and disjoint-set data structures (Union-Find).
Please assign this issue to me under Hacktoberfest 2024 label :)