Graph Theory

2685. 统计完全连通分量的数量

Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory

Hard | Graph Theory, Heap (Priority Queue), Shortest Path

Hard | Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory

Hard | Dynamic Programming, Depth-First Search, Graph Theory, Topological Sort, Memoization

Medium | Graph Theory

Hard | Bit Manipulation, Graph Theory, Heap (Priority Queue), Enumeration, Shortest Path

Hard | Array, Dynamic Programming, Graph Theory, Topological Sort

Hard | Array, Backtracking, Graph Theory

Hard | Union-Find, Graph Theory

Hard | Array, Depth-First Search, Graph Theory, Eulerian Circuit

Medium | Array, Math, Depth-First Search, Breadth-First Search, Graph Theory, Geometry

Medium | Array, Hash Table, String, Graph Theory, Topological Sort

Hard | Array, Dynamic Programming, Depth-First Search, Graph Theory, Topological Sort

Medium | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort

Hard | Graph Theory, Heap (Priority Queue), Shortest Path

Hard | Array, String, Tree, Depth-First Search, Graph Theory, Topological Sort

Medium | Greedy, Graph Theory, Sorting, Heap (Priority Queue)

Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path

Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory

Hard | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix