Similar Topics

DSA

21.9k+ articles

Difference Between

4.3k+ articles

Greedy

2k+ articles

GATE CS

1.5k+ articles

Tree

1.3k+ articles

Data Structures

1.1k+ articles

Graph

910+ articles

union-find

54 articles

Minimum Spanning Tree

11 articles

Kruskal'sAlgorithm

8 articles

MST

25 posts

Number of Critical and Pseudo-Critical edges

Last Updated: 17 December 2023

Given a weighted undirected graph with n vertices numbered from 0 to n - 1, and an array of edges where edges[i] = [u, v, weight] represents...read more

Minimize rope length to connect given points in a 3D plane

Last Updated: 08 February 2023

Given a 2-D array A[][] of size N × 3, where each element of the array is of the form {x, y, z}, where x, y and z are coordinates of a poin ...read more

Check if an edge is a part of any Minimum Spanning Tree

Last Updated: 02 March 2023

Given a connected undirected weighted graph in the form of a 2D array where each row is of the type [start node, end node, weight] describin...read more

Similar Topics

DSA

21.9k+ articles

Difference Between

4.3k+ articles

Greedy

2k+ articles

GATE CS

1.5k+ articles

Tree

1.3k+ articles

Data Structures

1.1k+ articles

Graph

910+ articles

union-find

54+ articles

Minimum Spanning Tree

11+ articles

Kruskal'sAlgorithm

8+ articles

Minimize cost to connect the graph by connecting any pairs of vertices having cost at least 0

Last Updated: 23 March 2022

Given a disconnected graph G with N vertices and M edges and an array cost[] corresponding to each vertex, the task is to find the minimum c ...read more

Second Best Minimum Spanning Tree

Last Updated: 06 June 2023

Prerequisites - Graph, Spanning tree, Disjoint Set (Union - Find).A minimum spanning tree (MST) T, for a given graph G, spans over all verti...read more

Kruskal'sAlgorithm

Minimum Spanning Tree

Difference between Minimum Spanning Tree and Shortest Path

Last Updated: 01 July 2021

Spanning tree: A spanning tree (T) of an undirected graph(G) is a subgraph which is a tree that includes all the vertices of a graph (G) and...read more

Data Structures

Difference Between

Minimum cost required to connect all houses in a city

Last Updated: 24 February 2023

Given a 2D array houses[][] consisting of N 2D coordinates {x, y} where each coordinate represents the location of each house, the task is t...read more

Kruskal'sAlgorithm

Minimum Spanning Tree

Minimum Bottleneck Spanning Tree(MBST)

Last Updated: 01 November 2023

The minimum bottleneck spanning tree in an undirected graph is a tree whose most expensive edge is as minimum as possible. In this article, ...read more

Advanced Data Structure

Minimum Spanning Tree using Priority Queue and Array List

Last Updated: 05 November 2021

Given a bi-directed weighted (positive) graph without self-loops, the task is to generate the minimum spanning tree of the graph.Examples:In...read more

Advanced Data Structure

Competitive Programming

Data Structures

Boruvka's algorithm for Minimum Spanning Tree

Last Updated: 21 October 2022

Following two algorithms are generally taught for Minimum Spanning Tree (MST) problem. Prim's algorithm Kruskal's algorithm There is a third ...read more