In this article, we will be discussing the minimum spanning tree. So, to understand the minimum spanning tree, we first

Continue reading# Category: Graph

## Find the City With the Smallest Number of Neighbours at a Threshold Distance: G-43

Problem Statement: There are n cities numbered from 0 to n-1. Given the array edges where edges[i] = [fromi, toi,weighti]

Continue reading## Floyd Warshall Algorithm: G-42

Problem Statement: The problem is to find the shortest distances between every pair of vertices in a given edge-weighted directed

Continue reading## Bellman Ford Algorithm: G-41

Problem Statement: Given a weighted, directed and connected graph of V vertices and E edges, Find the shortest distance of

Continue reading## Dijkstra’s Algorithm – Using Set : G-33

Given a weighted, undirected, and connected graph of V vertices and an adjacency list adj where adj[i] is a list

Continue reading## Dijkstra’s Algorithm – Using Priority Queue : G-32

Given a weighted, undirected, and connected graph of V vertices and an adjacency list adj where adj[i] is a list

Continue reading## Word Ladder-II (Optimised Approach) G-31

Given two distinct words startWord and targetWord, and a list denoting wordList of unique words of equal lengths. Find all

Continue reading## G-30 : Word Ladder-II

Given two distinct words startWord and targetWord, and a list denoting wordList of unique words of equal lengths. Find all

Continue reading## Alien Dictionary – Topological Sort: G-26

Problem Statement: Given a sorted dictionary of an alien language having N words and k starting alphabets of a standard

Continue reading## Find Eventual Safe States – BFS – Topological Sort: G-25

Problem Statement: A directed graph of V vertices and E edges is given in the form of an adjacency list

Continue reading