[andrew cooke] > For the record - the version I posted (with breadth-first as an option) > wasn't reliable (it runs out of stack space on reasonable directory > structures). Apart from that, did you have a use case for breadth-first directory traversal? Because it's clumsier, you usually find BFS only used on search trees that are too deep/expensive to traverse exhaustively (e.g., a tree of chess moves), or that have infinite paths (so that DFS can't terminate even in theory). Directory trees aren't usually <wink> of that nature.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4