knoopx/dfs-vs-bfs
agent/skills/knowledge/dfs-vs-bfs/SKILL.md
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).
$ install --global
skillsauthnpx skillsauth add knoopx/pi dfs-vs-bfsInstall this skill globally with one command. Works with Claude Code, Cursor, and Windsurf.
Security Scan Results
3 of 9 scanners reported clean
Some scanners were skipped, did not run, or reported a non-clean status. Review each row below.
3
Scanners Passed
9
Scanners in report
Clean
TrivyContainer and dependency vulnerability scanner
95%
Clean
SemgrepStatic code analysis for vulnerabilities
95%
Clean
mcp-scan (Snyk)Model Context Protocol security validation
95%
Skipped
Snyk (dep)Open source security scanning
50%
Skipped
Socket.devSupply chain security analysis
50%
Skipped
VirusTotalMulti-engine malware detection
50%
Skipped
CrowdStrikeAdvanced threat intelligence
50%
Skipped
OSV-ScannerOpen Source Vulnerability database check
50%
Skipped
OWASP Dep-Check
50%
Last scanned: May 18, 2026, 6:37 AM157.5s1 file scanned
SKILL.md
- 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]
When to use
DFS (stack/recursion) explores one branch fully before backtracking. BFS (queue) explores level-by-level.
Rules
- If the problem asks "shortest" or "minimum steps" on an unweighted graph, ALWAYS choose BFS
- If it asks "all paths," "can we reach," or "count islands," DFS is simpler
- NEVER use BFS for cycle detection — DFS is the right tool
- Both visit each node once: O(V+E) time
DFS use cases
Cycle detection, topological sort, path existence, connected components, backtracking puzzles, flood fill.
BFS use cases
Shortest unweighted path, level-order traversal, nearest neighbor, minimum steps.
Example
"Count islands" → DFS flood-fill on 2D grid. "Shortest path in maze" → BFS with queue tracking (row, col, distance).
Related Skills
knoopx/notify
tools
VerifiedTrustedCommunity
Inform the user what is happening — skip passive lookups
52SKILL.mdUpdated May 20, 2026
knoopx/markdown-rendering
development
VerifiedTrustedCommunity
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.
52SKILL.mdUpdated May 20, 2026
knoopx/jj-hunk
testing
VerifiedTrustedCommunity
Programmatic hunk selection for Jujutsu — split, commit, or squash specific hunks without interactive prompts. Use when making partial commits or selective squashes.
52SKILL.mdUpdated May 18, 2026
knoopx/jj-core
content-media
VerifiedTrustedCommunity
Manage version control with Jujutsu (jj) — no staging area, immediate changes, smart rebasing. Use when navigating history, squashing, or pushing to Git remotes.
52SKILL.mdUpdated May 18, 2026