Part 1: Introduction to Graph Find both C++/Java codes of all problem in the articles in the first column. Topic
Continue readingCategory: Graph
Minimum Spanning Tree – Theory: G-44
In this article, we will be discussing the minimum spanning tree. So, to understand the minimum spanning tree, we first
Continue readingFind 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 readingFloyd 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 readingBellman 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 readingDijkstra’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 readingDijkstra’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 readingWord 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 readingG-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 readingAlien 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