# Graph Search

- [Word Ladder](https://wentao-shao.gitbook.io/leetcode/graph-search/word-ladder.md)
- [126.Word-Ladder-II](https://wentao-shao.gitbook.io/leetcode/graph-search/word-ladder/126.word-ladder-ii.md)
- [127.Word-Ladder](https://wentao-shao.gitbook.io/leetcode/graph-search/word-ladder/127.word-ladder.md)
- [10.Regular-Expression-Matching](https://wentao-shao.gitbook.io/leetcode/graph-search/10.regular-expression-matching.md)
- [1041.Robot-Bounded-In-Circle](https://wentao-shao.gitbook.io/leetcode/graph-search/1041.robot-bounded-in-circle.md)
- [1066.Campus-Bikes-II](https://wentao-shao.gitbook.io/leetcode/graph-search/1066.campus-bikes-ii.md)
- [1087.Brace-Expansion](https://wentao-shao.gitbook.io/leetcode/graph-search/1087.brace-expansion.md)
- [1102.Path-With-Maximum-Minimum-Value](https://wentao-shao.gitbook.io/leetcode/graph-search/1102.path-with-maximum-minimum-value.md)
- [113.Path-Sum-II](https://wentao-shao.gitbook.io/leetcode/graph-search/113.path-sum-ii.md)
- [1192.Critical-Connections-in-a-Network](https://wentao-shao.gitbook.io/leetcode/graph-search/1192.critical-connections-in-a-network.md)
- [1197.Minimum-Knight-Moves](https://wentao-shao.gitbook.io/leetcode/graph-search/1197.minimum-knight-moves.md)
- [1219.Path-with-Maximum-Gold](https://wentao-shao.gitbook.io/leetcode/graph-search/1219.path-with-maximum-gold.md)
- [1239.Maximum-Length-of-a-Concatenated-String-with-Unique-Characters](https://wentao-shao.gitbook.io/leetcode/graph-search/1239.maximum-length-of-a-concatenated-string-with-unique-characters.md)
- [1284.Minimum-Number-of-Flips-to-Convert-Binary-Matrix-to-Zero-Matrix](https://wentao-shao.gitbook.io/leetcode/graph-search/1284.minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix.md)
- [1293.Shortest-Path-in-a-Grid-with-Obstacles-Elimination](https://wentao-shao.gitbook.io/leetcode/graph-search/1293.shortest-path-in-a-grid-with-obstacles-elimination.md)
- [131.Palindrome-Partitioning](https://wentao-shao.gitbook.io/leetcode/graph-search/131.palindrome-partitioning.md)
- [133.Clone-Graph](https://wentao-shao.gitbook.io/leetcode/graph-search/133.clone-graph.md)
- [1345.Jump-Game-IV](https://wentao-shao.gitbook.io/leetcode/graph-search/1345.jump-game-iv.md)
- [1376.Time-Needed-to-Inform-All-Employees](https://wentao-shao.gitbook.io/leetcode/graph-search/1376.time-needed-to-inform-all-employees.md)
- [139.Word-Break](https://wentao-shao.gitbook.io/leetcode/graph-search/139.word-break.md)
- [140.Word-Break-II](https://wentao-shao.gitbook.io/leetcode/graph-search/140.word-break-ii.md)
- [1416.Restore-The-Array](https://wentao-shao.gitbook.io/leetcode/graph-search/1416.restore-the-array.md)
- [17.Letter-Combinations-of-a-Phone-Number](https://wentao-shao.gitbook.io/leetcode/graph-search/17.letter-combinations-of-a-phone-number.md)
- [179.Largest-Number](https://wentao-shao.gitbook.io/leetcode/graph-search/179.largest-number.md)
- [200.Number-of-Islands](https://wentao-shao.gitbook.io/leetcode/graph-search/200.number-of-islands.md)
- [212.Word-Search-II](https://wentao-shao.gitbook.io/leetcode/graph-search/212.word-search-ii.md)
- [22.Generate-Parentheses](https://wentao-shao.gitbook.io/leetcode/graph-search/22.generate-parentheses.md)
- [248.Strobogrammatic-Number-III](https://wentao-shao.gitbook.io/leetcode/graph-search/248.strobogrammatic-number-iii.md)
- [286.Walls-and-Gates](https://wentao-shao.gitbook.io/leetcode/graph-search/286.walls-and-gates.md)
- [289.Game-of-Life](https://wentao-shao.gitbook.io/leetcode/graph-search/289.game-of-life.md)
- [298.Binary-Tree-Longest-Consecutive-Sequence](https://wentao-shao.gitbook.io/leetcode/graph-search/298.binary-tree-longest-consecutive-sequence.md)
- [301.Remove-Invalid-Parentheses](https://wentao-shao.gitbook.io/leetcode/graph-search/301.remove-invalid-parentheses.md)
- [312.Burst-Balloons](https://wentao-shao.gitbook.io/leetcode/graph-search/312.burst-balloons.md)
- [317.Shortest-Distance-from-All-Buildings](https://wentao-shao.gitbook.io/leetcode/graph-search/317.shortest-distance-from-all-buildings.md)
- [320.Generalized-Abbreviation](https://wentao-shao.gitbook.io/leetcode/graph-search/320.generalized-abbreviation.md)
- [323.Number-of-Connected-Components-in-an-Undirected-Graph](https://wentao-shao.gitbook.io/leetcode/graph-search/323.number-of-connected-components-in-an-undirected-graph.md)
- [329.Longest-Increasing-Path-in-a-Matrix](https://wentao-shao.gitbook.io/leetcode/graph-search/329.longest-increasing-path-in-a-matrix.md)
- [364.Nested-List-Weight-Sum-II](https://wentao-shao.gitbook.io/leetcode/graph-search/364.nested-list-weight-sum-ii.md)
- [386.Lexicographical-Numbers](https://wentao-shao.gitbook.io/leetcode/graph-search/386.lexicographical-numbers.md)
- [39.Combination-Sum](https://wentao-shao.gitbook.io/leetcode/graph-search/39.combination-sum.md)
- [399.Evaluate-Division](https://wentao-shao.gitbook.io/leetcode/graph-search/399.evaluate-division.md)
- [40.Combination-Sum-II](https://wentao-shao.gitbook.io/leetcode/graph-search/40.combination-sum-ii.md)
- [417.Pacific-Atlantic-Water-Flow](https://wentao-shao.gitbook.io/leetcode/graph-search/417.pacific-atlantic-water-flow.md)
- [430.Flatten-a-Multilevel-Doubly-Linked-List](https://wentao-shao.gitbook.io/leetcode/graph-search/430.flatten-a-multilevel-doubly-linked-list.md)
- [437.Path-Sum-III](https://wentao-shao.gitbook.io/leetcode/graph-search/437.path-sum-iii.md)
- [44.Wildcard-Matching](https://wentao-shao.gitbook.io/leetcode/graph-search/44.wildcard-matching.md)
- [463.Island-Perimeter](https://wentao-shao.gitbook.io/leetcode/graph-search/463.island-perimeter.md)
- [465.Optimal-Account-Balancing](https://wentao-shao.gitbook.io/leetcode/graph-search/465.optimal-account-balancing.md)
- [489.Robot-Room-Cleaner](https://wentao-shao.gitbook.io/leetcode/graph-search/489.robot-room-cleaner.md)
- [490.The-Maze](https://wentao-shao.gitbook.io/leetcode/graph-search/490.the-maze.md)
- [494.Target-Sum](https://wentao-shao.gitbook.io/leetcode/graph-search/494.target-sum.md)
- [51.N-Queens](https://wentao-shao.gitbook.io/leetcode/graph-search/51.n-queens.md)
- [515.Find-Largest-Value-in-Each-Tree-Row](https://wentao-shao.gitbook.io/leetcode/graph-search/515.find-largest-value-in-each-tree-row.md)
- [524.Longest-Word-in-Dictionary-through-Deleting](https://wentao-shao.gitbook.io/leetcode/graph-search/524.longest-word-in-dictionary-through-deleting.md)
- [529.Minesweeper](https://wentao-shao.gitbook.io/leetcode/graph-search/529.minesweeper.md)
- [547.Number-of-Provinces](https://wentao-shao.gitbook.io/leetcode/graph-search/547.number-of-provinces.md)
- [568.Maximum-Vacation-Days](https://wentao-shao.gitbook.io/leetcode/graph-search/568.maximum-vacation-days.md)
- [675.Cut-Off-Trees-for-Golf-Event](https://wentao-shao.gitbook.io/leetcode/graph-search/675.cut-off-trees-for-golf-event.md)
- [679.24-Game](https://wentao-shao.gitbook.io/leetcode/graph-search/679.24-game.md)
- [695.Max-Area-of-Island](https://wentao-shao.gitbook.io/leetcode/graph-search/695.max-area-of-island.md)
- [698.Partition-to-K-Equal-Sum-Subsets](https://wentao-shao.gitbook.io/leetcode/graph-search/698.partition-to-k-equal-sum-subsets.md)
- [721.Accounts-Merge](https://wentao-shao.gitbook.io/leetcode/graph-search/721.accounts-merge.md)
- [733.Flood-Fill](https://wentao-shao.gitbook.io/leetcode/graph-search/733.flood-fill.md)
- [737.Sentence-Similarity-II](https://wentao-shao.gitbook.io/leetcode/graph-search/737.sentence-similarity-ii.md)
- [743.Network-Delay-Time](https://wentao-shao.gitbook.io/leetcode/graph-search/743.network-delay-time.md)
- [752.Open-the-Lock](https://wentao-shao.gitbook.io/leetcode/graph-search/752.open-the-lock.md)
- [753.Cracking-the-Safe](https://wentao-shao.gitbook.io/leetcode/graph-search/753.cracking-the-safe.md)
- [773.Sliding-Puzzle](https://wentao-shao.gitbook.io/leetcode/graph-search/773.sliding-puzzle.md)
- [79.Word-Search](https://wentao-shao.gitbook.io/leetcode/graph-search/79.word-search.md)
- [802.Find-Eventual-Safe-States](https://wentao-shao.gitbook.io/leetcode/graph-search/802.find-eventual-safe-states.md)
- [815.Bus-Routes](https://wentao-shao.gitbook.io/leetcode/graph-search/815.bus-routes.md)
- [818.Race-Car](https://wentao-shao.gitbook.io/leetcode/graph-search/818.race-car.md)
- [854.K-Similar-Strings](https://wentao-shao.gitbook.io/leetcode/graph-search/854.k-similar-strings.md)
- [863.All-Nodes-Distance-K-in-Binary-Tree](https://wentao-shao.gitbook.io/leetcode/graph-search/863.all-nodes-distance-k-in-binary-tree.md)
- [864.Shortest-Path-to-Get-All-Keys](https://wentao-shao.gitbook.io/leetcode/graph-search/864.shortest-path-to-get-all-keys.md)
- [909.Snakes-and-Ladders](https://wentao-shao.gitbook.io/leetcode/graph-search/909.snakes-and-ladders.md)
- [93.Restore-IP-Addresses](https://wentao-shao.gitbook.io/leetcode/graph-search/93.restore-ip-addresses.md)
- [95.Unique-Binary-Search-Trees-II](https://wentao-shao.gitbook.io/leetcode/graph-search/95.unique-binary-search-trees-ii.md)
- [96.Unique-Binary-Search-Trees](https://wentao-shao.gitbook.io/leetcode/graph-search/96.unique-binary-search-trees.md)
- [994.Rotting-Oranges](https://wentao-shao.gitbook.io/leetcode/graph-search/994.rotting-oranges.md)


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://wentao-shao.gitbook.io/leetcode/graph-search.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.