图·DFS·traversal模式

克隆图

Clone Graph involves cloning a graph using DFS, focusing on graph traversal and neighbor management using hash tables.

重新安排行程

Reconstruct Itinerary requires building a valid travel route using all tickets once, starting from JFK with lexical orde…

除法求值

Compute the results of division queries from given equations using graph traversal and depth-first search efficiently.

省份数量

Solve Number of Provinces by scanning the adjacency matrix and launching DFS once per unvisited city component.

冗余连接

Identify and remove the redundant edge that causes a cycle in a graph starting as a tree.

冗余连接 II

Find and remove the redundant connection in a directed graph that was originally a rooted tree.

网络延迟时间

Find the minimum time for a signal to travel to all nodes in a directed graph or determine if it's impossible.

破解保险箱

The Cracking the Safe problem involves finding the shortest password sequence to unlock a safe using graph traversal and…

情侣牵手

This problem requires arranging couples sitting apart in a row with the minimum number of swaps using graph traversal an…

判断二分图

Determine whether an undirected graph can be split into two independent sets using DFS, BFS, or Union Find patterns.

K 站中转内最便宜的航班

Find the cheapest flight from a source to a destination with at most K stops using graph traversal techniques efficientl…

所有可能的路径

Find all paths in a directed acyclic graph (DAG) from source to target using depth-first search and backtracking.

树中距离之和

The problem asks to compute the sum of distances between each node and all others in a tree structure using depth-first …

钥匙和房间

Determine if all rooms can be visited given keys distributed across a set of interconnected locked rooms using graph tra…

可能的二分法

Determine if a group of n people with mutual dislikes can be split into two non-conflicting groups using graph traversal…

移除最多的同行或同列石头

Maximize the number of stones removed from a 2D plane using graph traversal and DFS.

不邻接植花

In this problem, you are tasked with planting flowers in gardens with specific constraints based on graph traversal prin…

查找集群内的关键连接

Find critical connections in a network of servers, ensuring efficient traversal using depth-first search and Tarjan's al…

连通网络的操作次数

Determine the minimum number of operations required to connect all computers in a network with a limited number of cable…

验证二叉树

Validate Binary Tree Nodes problem requires checking if a set of nodes forms a valid binary tree using graph traversal.

T 秒后青蛙的位置

The problem asks for the probability that a frog reaches a target vertex after t seconds in a tree graph.

重新规划路线

Reorder Routes to Make All Paths Lead to the City Zero involves reversing the direction of roads in a tree to ensure all…

寻找图中是否存在路径

Determine if a valid path exists between two vertices in a bi-directional graph using traversal techniques.

找出知晓秘密的所有专家

Find all people who receive a secret through meetings using graph traversal with depth-first search efficiently and corr…