Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

Arrays4.2K+ articles

Greedy1.4K+ articles

Sorting1.1K+ articles

Graph564+ articles

disjoint-set51+ articles

LCA38+ articles

MST25+ articles

Minimum Spanning Tree12+ articles

Kruskal'sAlgorithm

8 posts

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

Analysis of Algorithms

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

article_image

Kruskal'sAlgorithm

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

article_image

Kruskal'sAlgorithm

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

article_image

Kruskal'sAlgorithm

Minimum Spanning Tree

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

article_image

Kruskal'sAlgorithm

Minimum Spanning Tree

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

Kruskal'sAlgorithm

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

article_image

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

article_image

Kruskal'sAlgorithm