Courses
Tutorials
Interview Prep
DSA
Practice Problems
C
C++
Java
Python
JavaScript
Data Science
Machine Learning
Courses
Linux
DevOps
Similar Topics
Web Technologies
32.1K+ articles
DSA
20.4K+ articles
Arrays
4.2K+ articles
Greedy
1.4K+ articles
Sorting
1.1K+ articles
Graph
564+ articles
disjoint-set
51+ articles
LCA
38+ articles
MST
25+ articles
Minimum Spanning Tree
12+ articles
Kruskal'sAlgorithm
8 posts
Recent Articles
Popular Articles
Time and Space Complexity Analysis of Kruskal Algorithm
Last Updated: 23 July 2025
Kruskal's algorithm is a popular algorithm for finding the Minimum Spanning Tree (MST) of a connected, undirected graph. The time complexity of Kruskal's algorithm is O(E ...
read more
Graph
Analysis of Algorithms
DSA
Kruskal'sAlgorithm
Find Edge Weights in a Spanning Tree with Edge (u, v)
Last Updated: 23 July 2025
Given an undirected weighted graph with N nodes and M edges, the task is for each edge (u, v) find the minimum possible weight of the Spanning Tree which contains the edge...
read more
Picked
DSA
Trees
Kruskal'sAlgorithm
DFS
LCA
Geeks Premier League 2023
Minimum cost to provide water
Last Updated: 23 July 2025
Given an integer N, where N denotes the number of villages numbered 1 to N, an array wells[] where wells[i] denotes the cost to build a water well in the i'th city, a 2D ...
read more
Graph
DSA
Kruskal'sAlgorithm
union-find
disjoint-set
Minimum cost to connect all houses in a city
Last Updated: 28 March 2026
Given a 2D array houses[][] consisting of n 2D coordinates [x, y] where each coordinate represents the location of each house, find the minimum cost to connect all the hou...
read more
Graph
Greedy
Sorting
DSA
Arrays
Kruskal'sAlgorithm
Minimum Spanning Tree
MST
Second Best Minimum Spanning Tree
Last Updated: 23 November 2025
Given a weighted undirected graph represented using an adjacency list adj[][], where each adj[u] contains pairs of the form {v, w}, indicating that vertex u is connected t...
read more
DSA
Kruskal'sAlgorithm
Minimum Spanning Tree
MST
LCA
Minimum Cost Graph
Last Updated: 12 July 2025
Given N nodes on a 2-D plane represented as (xi, yi). The nodes are said to be connected if the manhattan distance between them is 1. You can connect two nodes that are no...
read more
DSA
Kruskal'sAlgorithm
disjoint-set
Find the weight of the minimum spanning tree
Last Updated: 11 July 2025
Given a connected undirected weighted graph with N nodes and M edges. The task is to perform given queries and find the weight of the minimum spanning tree. Queries are of...
read more
DSA
Kruskal'sAlgorithm
Minimum Spanning Tree
Kruskal’s Minimum Spanning Tree (MST) Algorithm
Last Updated: 20 December 2025
A minimum spanning tree (MST) or minimum weight spanning tree for a weighted, connected, and undirected graph is a spanning tree (no cycles and connects all vertices) that...
read more
Graph
Greedy
DSA
Kruskal
Kruskal'sAlgorithm
MST