Graphs Problems

Given a sorted dictionary of an alien language having N words and k starting alphabets of standard dictionary. Find the

Only read the BFS part if in hurry.

if distance[u] + w < distance[v], update distance[v] = distance[u] + w.

You are given an integer n. There is an undirected graph with n vertices, numbered from 0 to n - 1. You are given a 2D i

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prere

Breadth-First Search (BFS) explores nodes level by level. If a neighbor is encountered that has already been visited and

static class DisjointSet {

There is a directed graph of n nodes with each node labeled from 0 to n - 1. The graph is represented by a 0-indexed 2D

solving all-pairs shortest path problems, and detecting negative cycles in graphs.

A tree is an undirected graph in which any two vertices are connected by exactly one path. In other words, any connected

You are given an array points representing integer coordinates of some points on a 2D-plane, where points[i] = [xi, yi].

You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed ed

There are n cities. Some of them are connected, while some are not. If city a is connected directly with city b, and cit

There are n computers numbered from 0 to n - 1 connected by ethernet cables connections forming a network where connecti

Run this to see how PRIMS algorithm find MST.

You are given an m x n grid where each cell can have one of three values:

When to use Topological Sort:

There is an undirected graph with n nodes, where each node is numbered between 0 and n - 1. You are given a 2D array gra