tavianator/bfs
A breadth-first version of the UNIX find command observed · 2026-08-28
Health v2 · maintenance only
92/100
- Activity 99
- Release rhythm 78
- Longevity 100
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-09-03. Adoption (stars, forks) is never an input.
- gap_med: 39
- age_days: 4098
- days_rel: 65
- days_push: 9
- n_releases_24m: 12
Adoption not part of the score
1258 stars · 43 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
bfs is a breadth-first variant of the UNIX find command, written in C. It is largely compatible with POSIX, GNU, BSD, and macOS find, but returns files shallowest-first so matches are typically found faster.
Use cases
- find files in a directory tree faster than find
- drop-in replacement for unix find command
- search filesystem breadth-first
- locate shallow files without waiting for deep subtrees
- compatible find command for linux and macos
When to choose
- you use find regularly and want faster, shallower-first results
- you want a mostly drop-in find replacement with extra features
- you work on Linux, macOS, or BSD and want a fast C implementation
When to avoid
- you need exact depth-first traversal order of GNU find
- you rely on scripts depending on find's precise output ordering
Facets
cli-tool · maturity active
file-system search-engine cli developer-tools files bsd cli find-replacement breadth-first-search unix-tools file-search command-line linux macos
2 sources
- readme: https://github.com/tavianator/bfs · fetched 2026-08-28 · 3773177676d4
- homepage: https://tavianator.com/projects/bfs.html · fetched 2026-08-29 · 591abf285ede
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| tavianator/bfs | main | 92 |
For agents
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem