General Problems
We will discuss how to solve different types of questions based on MST: 1. Conceptual questions based on MST, 2. How to find the weight of the minimum spanning tree given the graph, 3. How many minimum spanning trees are possible using Kruskal’s algorithm for a given graph, 4. Out of given sequences, which one is not the sequence of edges added to the MST using Kruskal’s algorithm.
Minimum cost to connect all cities
By Yukti Kumari
● Published At Dec 2021
This article explains how to solve the problem of finding the minimum cost to connect all cities. ... Keep reading ..
Water Connection Problem
By Vibhor Bhatnagar
● Published At Dec 2021
This article will discuss the water connection problem.... Keep reading ..
Commutable Island
By Nishant Rana
● Published At Feb 2022
This blog will cover the question of Commutable Islands and discuss their Time and Space complexity. ... Keep reading ..