Tutorials
Courses
Go Premium

Similar Topics

Web Technologies32.1K+ articles

DSA20.0K+ articles

Greedy1.4K+ articles

Graph560+ articles

math137+ articles

LCA38+ articles

MST25+ articles

Kruskal'sAlgorithm8+ articles

Graph Minimum Spanning Tree6+ articles

In-house+ articles

Minimum Spanning Tree

12 posts

Construct MST from GCD

Last Updated: 23 July 2025

Given an array arr[] of N integers. and an integer K. Construct a weighted undirected graph of N vertices numbered from 0 to N-1. An edge between the vertices i and j (ji)...read more

article_image

Minimum Spanning Tree

Which Minimum Spanning Tree Algorithm is better?

Last Updated: 23 July 2025

A spanning tree is defined as a tree-like sub-graph of a connected, undirected graph that includes all the graph's vertices. Or, in Layman’s words, it is a subset of the e...read more

article_image

Minimum Spanning Tree

Spanning Tree vs Minimum Spanning Tree

Last Updated: 30 October 2023

Spanning Tree (ST):A spanning tree of a graph is a subgraph that includes all the vertices of the original graph and is also a tree (a connected acyclic graph).The primary...read more

Minimum Spanning Tree

Last Updated: 23 July 2025

In this article, we are going to cover one of the most commonly asked DSA topic which is the Spanning Tree with its definition, properties, and applications. Moreover, we ...read more

article_image

Minimum Spanning Tree

Properties of Minimum Spanning Tree (MST)

Last Updated: 23 July 2025

For a connected and undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices together. A single graph can have multiple s...read more

article_image

Minimum Spanning Tree

Graph Minimum Spanning Tree

Minimize count of connections required to be rearranged to make all the computers connected

Last Updated: 26 July 2025

Given an integer N, denoting the number of computers connected by cables forming a network and a 2D array connections[][], with each row (i, j) representing a connection b...read more

Minimum Spanning Tree

connected-components

Minimum cost to connect all houses in a city

Last Updated: 23 July 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

Second Best Minimum Spanning Tree

Last Updated: 15 July 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

Find the minimum spanning tree with alternating colored edges

Last Updated: 17 March 2023

Given a graph with N nodes and M edges where each edge has a color (either black or green) and a cost associated with it. Find the minimum spanning tree of the graph such ...read more

article_image

Minimum Spanning Tree

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

Minimum spanning tree cost of given Graphs

Last Updated: 11 July 2025

Given an undirected graph of V nodes (V 2) named V1, V2, V3, ..., Vn. Two nodes Vi and Vj are connected to each other if and only if 0 | i - j | ? 2. Each edge between a...read more

article_image

Minimum Spanning Tree

Graph Minimum Spanning Tree

Prim’s Algorithm for Minimum Spanning Tree (MST)

Last Updated: 23 July 2025

Prim’s algorithm is aGreedy algorithm like Kruskal's algorithm. This algorithm always starts with a single node and moves through several adjacent nodes, in order to explo...read more

article_image

Minimum Spanning Tree

Prim's Algorithm.MST