Graph

There is an undirected star graph consisting of n nodes labeled from 1 to n.

There is a bi-directional graph with n vertices, where each vertex is labeled from 0 to n - 1 (inclusive).

In a town, there are n people labeled from 1 to n.

Given a directed acyclic graph (DAG) of n nodes labeled from 0 to n - 1, find all possible paths from node 0 to node n - 1 and return them in any order.

There are n cities connected by some number of flights.

You are given an integer n.

You are given three positive integers n, x, and y.

You are given an integer n.

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1.

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1.

There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1.

You are given a list of bombs.

You are given two integers n and m that consist of the same number of digits.

You are given an array of variable pairs equations and an array of real numbers values, where equations[i] = [Ai, Bi] and values[i] represent the equation Ai / Bi = values[i].

You are given an m x n binary matrix grid and an integer health.

You have information about n different recipes.

There are n teams numbered from 0 to n - 1 in a tournament; each team is also a node in a DAG.

You are given a directed graph of n nodes numbered from 0 to n - 1, where each node has at most one outgoing edge.

There is a directed graph of n nodes with each node labeled from 0 to n - 1.

There is a dungeon with n x m rooms arranged as a grid.

There is a dungeon with n x m rooms arranged as a grid.

There are n cities numbered from 0 to n-1.

You have n gardens, labeled from 1 to n, and an array paths where paths[i] = [xi, yi] describes a bidirectional path between garden xi to garden yi.

There are n people, each person has a unique id between 0 and n-1.

There is an undirected graph with n nodes, where each node is numbered between 0 and n - 1.

There are n rooms labeled from 0 to n - 1 and all the rooms are locked except for room 0.

There is a group of n people labeled from 0 to n - 1 where each person has a different amount of money and a different level of quietness.

There is an infrastructure of n cities with some number of roads connecting these cities.

You are given a string initialCurrency, and you start with 1.0 of initialCurrency.

There is an undirected graph consisting of n nodes numbered from 0 to n - 1.

You are given an integer n denoting the number of cities in a country.

You are given an integer n and a Directed Acyclic Graph (DAG) with n nodes labeled from 0 to n - 1.

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

You are given an undirected connected graph with n nodes labeled from 0 to n - 1 and a 2D integer array edges where edges[i] = [ui, vi, wi] denotes an undirected edge between node...

You are given two integers, n and threshold, as well as a directed weighted graph of n nodes numbered from 0 to n - 1.

You are given an array start where start = [startX, startY] represents your initial position (startX, startY) in a 2D space.

You are given two 0-indexed strings source and target, both of length n and consisting of lowercase English letters.

There is a tree (i.e., a connected, undirected graph with no cycles) structure country network consisting of n cities numbered from 0 to n - 1 and exactly n - 1 roads.

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

Given a directed acyclic graph, with n vertices numbered from 0 to n-1, and an array edges where edges[i] = [fromi, toi] represents a directed edge from node fromi to node toi.

You are given a positive integer n representing n cities numbered from 1 to n.

You are given an integer n and an undirected graph with n nodes labeled from 0 to n - 1.

You are given an integer n and a directed graph with n nodes labeled from 0 to n - 1.

There is an undirected graph of n nodes.

There is an undirected tree with n nodes labeled from 0 to n - 1, rooted at node 0.

On a 2D plane, we place n stones at some integer coordinate points.

You are given a network of n nodes, labeled from 1 to n.

You are given a directed graph with n nodes labeled from 0 to n - 1, where each node has exactly one outgoing edge.

There are n computers numbered from 0 to n - 1 connected by ethernet cables connections forming a network where connections[i] = [ai, bi] represents a connection between computers...

There are n cities.

There is an undirected weighted connected graph.

You are in a city that consists of n intersections numbered from 0 to n - 1 with bi-directional roads between some intersections.

You are given an integer n representing the number of nodes in a graph, labeled from 0 to n - 1.

We want to split a group of n people (labeled from 1 to n) into two groups of any size.

You are given an integer c representing c power stations, each with a unique identifier id from 1 to c (1‑based indexing).

You are given a 2D integer array properties having dimensions n x m and an integer k.

There is an undirected tree with n nodes labeled from 0 to n - 1 and n - 1 edges.

In this problem, a tree is an undirected graph that is connected and has no cycles.

You are maintaining a project that has n methods numbered from 0 to n - 1.

There are n cities numbered from 0 to n - 1 and n - 1 roads such that there is only one way to travel between two different cities (this network form a tree).

You are given an array of strings equations that represent relationships between variables where each string equations[i] is of length 4 and takes one of two different forms:...

You are given an integer n and a 2D integer array queries.

You are given an integer n, the number of nodes in a directed graph where the nodes are labeled from 0 to n - 1.

There is a network of n servers, labeled from 0 to n - 1.

There are n types of units indexed from 0 to n - 1.

You have n binary tree nodes numbered from 0 to n - 1 where node i has two children leftChild[i] and rightChild[i], return true if and only if all the given nodes form exactly one...

There is an undirected graph consisting of n nodes numbered from 1 to n.

You are given a positive integer k.

A game on an undirected graph is played by two players, Mouse and Cat, who alternate turns.

A game is played by a cat and a mouse named Cat and Mouse.

An undirected graph of n nodes is defined by edgeList, where edgeList[i] = [ui, vi, disi] denotes an edge between nodes ui and vi with distance disi.

There exists an undirected and unrooted tree with n nodes indexed from 0 to n - 1.

You are given a 2D integer array edges representing an undirected graph having n nodes, where edges[i] = [ui, vi] denotes an edge between nodes ui and vi.

You are given an undirected graph defined by an integer n, the number of nodes, and a 2D integer array edges, the edges in the graph, where edges[i] = [ui, vi] indicates that...

You are given three positive integers n, x, and y.

There is a directed graph consisting of n nodes numbered from 0 to n - 1 and n directed edges.

You are an ant tasked with adding n new rooms numbered 0 to n-1 to your colony.

There are n couples sitting in 2n seats arranged in a row and want to hold hands.

There is a safe protected by a password.

There are n servers numbered from 0 to n - 1 connected by undirected server-to-server connections forming a network where connections[i] = [ai, bi] represents a connection between...

You are given a positive integer n representing the number of nodes in an undirected graph.

You are given an integer n indicating there are n people numbered from 0 to n - 1.

Given a weighted undirected connected graph with n vertices numbered from 0 to n - 1, and an array edges where edges[i] = [ai, bi, weighti] represents a bidirectional and weighted...

You are given an undirected weighted graph of n nodes numbered from 0 to n - 1.

There exist two undirected trees with n and m nodes, numbered from 0 to n - 1 and from 0 to m - 1, respectively.

You are given an array of strings words.

Given an undirected tree consisting of n vertices numbered from 1 to n.

There is a directed graph of n colored nodes and m edges.

You are given a directed graph of n nodes numbered from 0 to n - 1, where each node has at most one outgoing edge.

Given an m x n integers matrix, return the length of the longest increasing path in matrix.

You are given an integer n and an undirected graph with n nodes labeled from 0 to n - 1 and a 2D array edges, where edges[i] = [ui, vi] indicates an edge between nodes ui and vi.

You are given a tree (i.e.

You are given an integer n, representing n nodes numbered from 0 to n - 1 and a list of edges, where edges[i] = [ui, vi, si, musti]: You are also given an integer k, the maximum...

You have n boxes labeled from 0 to n - 1.

A company is organizing a meeting and has a list of n employees, waiting to be invited.

There is an undirected graph with n nodes numbered from 0 to n - 1 (inclusive).

You are given a Directed Acyclic Graph (DAG) with n nodes labeled from 0 to n - 1, represented by a 2D array edges, where edges[i] = [ui, vi] indicates a directed edge from node...

There is an undirected graph with n nodes, numbered from 0 to n - 1.

You are given an undirected connected graph of n nodes, numbered from 0 to n - 1.

You are given a network of n nodes represented as an n x n adjacency matrix graph, where the ith node is directly connected to the jth node if graph[i][j] == 1.

You are given a network of n nodes represented as an n x n adjacency matrix graph, where the ith node is directly connected to the jth node if graph[i][j] == 1.

There exists an undirected and unrooted tree with n nodes indexed from 0 to n - 1.

You are given two 0-indexed strings source and target, both of length n and consisting of lowercase English characters.

Given an m x n grid.

There is a country of n cities numbered from 0 to n - 1 where all the cities are connected by bi-directional roads.

There is an undirected weighted graph with n vertices labeled from 0 to n - 1.

You are given an undirected graph.

There is a simple directed graph with n nodes labeled from 0 to n - 1.

There is an undirected tree with n nodes labeled from 0 to n - 1.

You are given a 0-indexed 2D integer array grid of size m x n.

You are given n individuals at a base camp who need to cross a river to reach a destination using a single boat.

You are given a m x n matrix grid consisting of non-negative integers where grid[row][col] represents the minimum time required to be able to visit the cell (row, col), which...

You are given an integer n denoting the number of nodes of a weighted directed graph.

You are given an undirected weighted connected graph containing n nodes labeled from 0 to n - 1, and an integer array edges where edges[i] = [ai, bi, wi] indicates that there is...

You are given a directed acyclic graph of n nodes numbered from 0 to n − 1.

There is a tree (i.e.

You are given an m x n integer matrix grid, where you can move from a cell to any adjacent cell in all 4 directions.

There is a company with n branches across the country, some of which are connected by roads.

You are given an array pairs, where pairs[i] = [xi, yi], and: Let ways be the number of rooted trees that satisfy the following conditions: Two ways are considered to be different...

You are given an integer n, which indicates that there are n courses labeled from 1 to n.