[PR #1077] [CLOSED] Create krushkals.c #1634

New Issue

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

claunia commented

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

📋 Pull Request Information

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

Base: master ← Head: patch-2

📝 Commits (5)

0c15204 Create krushkals.c
efa8153 Update krushkals.c
356df65 Update krushkals.c
fad97c4 Update krushkals.c
c902fec Update krushkals.c

📊 Changes

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

View changed files

➕ greedy_approach/krushkals.c (+90 -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/1077 **Author:** [@ankit-akash](https://github.com/ankit-akash) **Created:** 10/18/2022 **Status:** ❌ Closed **Base:** `master` ← **Head:** `patch-2` --- ### 📝 Commits (5) - [`0c15204`](https://github.com/TheAlgorithms/C/commit/0c15204d4477a2a0e64a7cc55a4d6dce9b9a54bd) Create krushkals.c - [`efa8153`](https://github.com/TheAlgorithms/C/commit/efa81539fb8f2c7df6bd49c3c07172089f67268e) Update krushkals.c - [`356df65`](https://github.com/TheAlgorithms/C/commit/356df653c578b36c9e52e4fe98b24d6a8714aa41) Update krushkals.c - [`fad97c4`](https://github.com/TheAlgorithms/C/commit/fad97c4f9141081ab2a20938db898ed5e199ca75) Update krushkals.c - [`c902fec`](https://github.com/TheAlgorithms/C/commit/c902fec1e078c3704bdbab0afc02701bdd946479) Update krushkals.c ### 📊 Changes **1 file changed** (+90 additions, -0 deletions) <details> <summary>View changed files</summary> ➕ `greedy_approach/krushkals.c` (+90 -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

Sign in to join this conversation.

1 Participants

Notifications

Due Date

No due date set.

Dependencies

No dependencies set.

Reference: starred/C#1634