summaryrefslogtreecommitdiffstats
path: root/docs/bfs.1
diff options
context:
space:
mode:
authorTavian Barnes <tavianator@tavianator.com>2023-06-09 16:34:41 -0400
committerTavian Barnes <tavianator@tavianator.com>2023-06-13 11:06:47 -0400
commitc023cceb3f50d92ed565ea3f085883f86de0f3f0 (patch)
treeafa4b05301e7c339a78e65d4c7a0c3443f553a93 /docs/bfs.1
parent0cca5b64e1355af5d2c3d935da4e110982273703 (diff)
downloadbfs-c023cceb3f50d92ed565ea3f085883f86de0f3f0.tar.xz
bftw: Use an I/O queue to open directories
Parallelism is controlled by the new -j flag.
Diffstat (limited to 'docs/bfs.1')
-rw-r--r--docs/bfs.18
1 files changed, 7 insertions, 1 deletions
diff --git a/docs/bfs.1 b/docs/bfs.1
index 53a9831..bc82457 100644
--- a/docs/bfs.1
+++ b/docs/bfs.1
@@ -171,12 +171,18 @@ consumes too much memory.
.TP
.I eds
Exponential deepening search.
-A compromise between breadth- and depth-first search, which searches exponentially increasing depth ranges (e.g 0-1, 1-2, 2-4, 4-8, etc.).
+A compromise between breadth- and depth-first search, which searches exponentially increasing depth ranges (e.g. 0-1, 1-2, 2-4, 4-8, etc.).
Provides many of the benefits of breadth-first search with depth-first's reduced memory consumption.
Typically far faster than
.B \-S
.IR ids .
.RE
+.TP
+\fB\-j\fIN\fR
+Search with
+.I N
+threads in parallel (default: number of CPUs, up to
+.IR 8 ).
.SH OPERATORS
.TP
\fB( \fIexpression \fB)\fR