[PR #1076] [CLOSED] Create krushkals.c #1635

New Issue

claunia · 2026-01-29T15:23:01Z

claunia commented

2026-01-29 15:23:01 +00:00

📋 Pull Request Information

Original PR: https://github.com/TheAlgorithms/C/pull/1076
Author: @ankit-akash
Created: 10/18/2022
Status: ❌ Closed

Base: master ← Head: patch-1

📝 Commits (1)

66d00a7 Create krushkals.c

📊 Changes

1 file changed (+78 additions, -0 deletions)

View changed files

➕ greedy_approach/krushkals.c (+78 -0)

📄 Description

Description of Change

-C Programming Implementation of Kruskal’s Algorithm

References

https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/

Checklist

Added description of change
Added file name matches File name guidelines
Added tests and example, test must pass
Relevant documentation/comments is changed or added
PR title follows semantic commit guidelines
Search previous suggestions before making a new one, as yours may be a duplicate.
I acknowledge that all my contributions will be made under the project's license.

Notes:
Kruskal’s algorithm is a greedy algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. It finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.

_{🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.}

## 📋 Pull Request Information **Original PR:** https://github.com/TheAlgorithms/C/pull/1076 **Author:** [@ankit-akash](https://github.com/ankit-akash) **Created:** 10/18/2022 **Status:** ❌ Closed **Base:** `master` ← **Head:** `patch-1` --- ### 📝 Commits (1) - [`66d00a7`](https://github.com/TheAlgorithms/C/commit/66d00a7ba03955026460725ec4fde77872ce6fc9) Create krushkals.c ### 📊 Changes **1 file changed** (+78 additions, -0 deletions) <details> <summary>View changed files</summary> ➕ `greedy_approach/krushkals.c` (+78 -0) </details> ### 📄 Description #### Description of Change -C Programming Implementation of Kruskal’s Algorithm  #### References  https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/ #### Checklist  - [x] Added description of change - [x] Added file name matches [File name guidelines](https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md#File-Name-guidelines) - [x] Added tests and example, test must pass - [x] Relevant documentation/comments is changed or added - [x] PR title follows semantic [commit guidelines](https://github.com/TheAlgorithms/C/blob/master/CONTRIBUTING.md#Commit-Guidelines) - [x] Search previous suggestions before making a new one, as yours may be a duplicate. - [x] I acknowledge that all my contributions will be made under the project's license. Notes:  Kruskal’s algorithm is a greedy algorithm in [graph theory](https://www.britannica.com/topic/graph-theory) that finds a minimum spanning tree for a connected weighted graph. It finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized. --- <sub>🔄 This issue represents a GitHub Pull Request. It cannot be merged through Gitea due to API limitations.</sub>

claunia added the pull-request label 2026-01-29 15:23:01 +00:00

claunia closed this issue

2026-01-29 15:23:02 +00:00

Sign in to join this conversation.

1 Participants

Notifications

Due Date

No due date set.

Dependencies

No dependencies set.

Reference: starred/C#1635