Tutorials
Courses

Similar Topics

Web Technologies37.4K+ articles

DSA22.8K+ articles

Competitive Programming3.2K+ articles

Greedy2.1K+ articles

Algorithms2.0K+ articles

Data Structures1.1K+ articles

Graph951+ articles

disjoint-set51+ articles

MST25+ articles

Minimum Spanning Tree12+ articles

Kruskal'sAlgorithm

8 posts

Find the weight of the minimum spanning tree

Last Updated: 16 January 2024

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

Competitive Programming

Data Structures

Kruskal'sAlgorithm

Minimum Spanning Tree

Minimum Cost Graph

Last Updated: 14 March 2023

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

Advanced Data Structure

Kruskal'sAlgorithm

Second Best Minimum Spanning Tree

Last Updated: 06 May 2025

Given an undirected graph represented by the array edges[][], where each edges[i] contains three integers [u, v, w], representing an undirected edge from u to v, having di...read more

article_image

Kruskal'sAlgorithm

Minimum Spanning Tree

Minimum cost to connect all houses in a city

Last Updated: 09 April 2025

Given a 2D array houses[][] consisting of n 2D coordinates {x, y} where each coordinate represents the location of each house, the task is to find the minimum cost to conn...read more

article_image

Kruskal'sAlgorithm

Minimum Spanning Tree

Minimum cost to provide water

Last Updated: 10 May 2024

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

Kruskal’s Minimum Spanning Tree (MST) Algorithm

Last Updated: 05 March 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

Find Edge Weights in a Spanning Tree with Edge (u, v)

Last Updated: 16 February 2024

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

Competitive Programming

Geeks Premier League

Kruskal'sAlgorithm

Geeks Premier League 2023

Time and Space Complexity Analysis of Kruskal Algorithm

Last Updated: 19 February 2024

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