diff options
| author | Tavian Barnes <tavianator@tavianator.com> | 2017-03-22 19:14:50 -0400 |
|---|---|---|
| committer | Tavian Barnes <tavianator@tavianator.com> | 2017-03-22 19:40:58 -0400 |
| commit | 998ba6f6d119608b0844c0ca735044746ea1fd0f (patch) | |
| tree | e48079cded830b57c4e412d620bb7b1607b04499 /tests/test_L_lname.out | |
| parent | c32385d4c8eb0e54af27712ff3fc82df1bda01e8 (diff) | |
| download | bfs-998ba6f6d119608b0844c0ca735044746ea1fd0f.tar.xz | |
bftw: Only rebuild the part of the path that changes
Quadratic complexity is still possible for directory structures like
root -- a -- a -- a -- a ...
|
+- b -- b -- b -- b ...
But for most realistic directory structures, bfs should now spend less
time building paths.
(Of course if you print every path, overall complexity is quadratic
anyway.)
Diffstat (limited to 'tests/test_L_lname.out')
0 files changed, 0 insertions, 0 deletions