search

AlgoGenesis / C

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
88 stars 306 forks source link

[NEW ALGORITHM] Kruskal’s Algorithm - Minimum Spanning Tree #1477

Closed yashksaini-coder closed 2 weeks ago

yashksaini-coder commented 2 weeks ago

Name:

[NEW ALGORITHM] Kruskal’s Algorithm - Minimum Spanning Tree

About:

Kruskal’s Algorithm is a greedy algorithm used to find the Minimum Spanning Tree (MST) of a connected, undirected graph. It works by sorting all edges by their weights and adding them one by one to the MST, ensuring no cycles are formed. This algorithm is efficient for sparse graphs and widely used in network design, where connecting nodes with minimum cost is crucial.

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1

Assignees:

Issue will be closed if:

1) You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
2) You propose an algorithm that is already present or has been mentioned in a previous issue.
3) You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.

yashksaini-coder commented 2 weeks ago

i would like to work this issue.

Hi @surbhisharma004 I have raised this issue, if you want you can later raise an issue to improve my algorithm,

yashksaini-coder commented 2 weeks ago

@pankaj-bind there's no issue for this