onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2025-01-18 08:40:52 +00:00
Code Issues Packages Projects Releases Wiki Activity
6b947083e4
grokking-algorithms/chapter7
History
onyx-and-iris 6b947083e4 reword
2024-01-12 12:32:53 +00:00
..
bfs_dirtrav.py reword 2024-01-12 12:32:53 +00:00
dfs_dirtrav.py reword 2024-01-12 12:32:53 +00:00
README.md upd bfs, dfs on rooted tree 2024-01-12 12:19:51 +00:00

README.md

DFS BFS on rooted tree

The BFS example uses a queue which results in a breadth first search. When a directory is found its contents are appended to the queue to be processed later

The DFS example uses the call stack which results in a depth first search. When a directory is found it is recursively passed to files_with_extension to be processed immediately.