菜单
Choose between DFS and BFS for graph traversal problems. Use when deciding whether to explore depth-first (cycle detection, paths) or breadth-first (shortest path, levels).
用 Codex 或 Claude 帮你安装 复制这段 Prompt，粘贴到 Codex、Claude 或其他助手里，让它检查 Skill 页面并帮你完成安装。
Renders markdown to self-contained HTML with a custom dark stylesheet and opens in browser. Use when previewing markdown documents, generating styled HTML from README or report files.
Inform the user what is happening — skip passive lookups
Manage version control with Jujutsu (jj) — no staging area, immediate changes, smart rebasing. Use when navigating history, squashing, or pushing to Git remotes.
Programmatic hunk selection for Jujutsu — split, commit, or squash specific hunks without interactive prompts. Use when making partial commits or selective squashes.
Gather facts from the web using evidence-first approach with mandatory citations. Use when researching topics, answering factual questions, or any task requiring web-sourced evidence.
Model minimum-move problems as BFS over a state space. Use when solving bucket pouring puzzles, sliding tiles, or any problem asking for the shortest sequence of moves to reach a goal.
| name | dfs-vs-bfs |
| description | Choose between DFS and BFS for graph traversal problems. Use when deciding whether to explore depth-first (cycle detection, paths) or breadth-first (shortest path, levels). |
| topic | Graph Traversal |
| token_cost | 100 |
| related | ["bfs-state-space","recursion-backtracking"] |
| keywords | ["dfs","bfs","depth","breadth","graph","traverse","path","maze","shortest","connected","reachable","visited","queue","stack","neighbor","walk","flood","fill","island"] |
DFS (stack/recursion) explores one branch fully before backtracking. BFS (queue) explores level-by-level.
Cycle detection, topological sort, path existence, connected components, backtracking puzzles, flood fill.
Shortest unweighted path, level-order traversal, nearest neighbor, minimum steps.
"Count islands" → DFS flood-fill on 2D grid. "Shortest path in maze" → BFS with queue tracking (row, col, distance).
