1192. 网络中的关键连接
Hard | Depth-First Search, Graph Theory, Biconnected Component
Graph Theory
1489. 找到最小生成树里的关键边和伪关键边
Hard | Union-Find, Graph Theory, Sorting, Minimum Spanning Tree, Strongly Connected Component
1579. 保持图可完全遍历的最多删除边数
Hard | Union-Find, Graph Theory
1916. 蚁群建房间的方案数
Hard | Array, Math, Dynamic Programming, Tree, Depth-First Search, Graph Theory, Topological Sort, Combinatorics
547. 省份数量
Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
785. 判断二分图
Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
886. 可能的二分图
Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
913. 猫和老鼠
Hard | Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Game Theory
3203. 合并两棵树后的最小直径
Hard | Tree, Depth-First Search, Breadth-First Search, Graph Theory
3241. 标记所有节点所需的时间
Hard | Dynamic Programming, Tree, Depth-First Search, Graph Theory