onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2024-11-15 17:30:52 +00:00
Code Issues Packages Projects Releases Wiki Activity
ec899f2a73
grokking-algorithms/chapter7
History
onyx-and-iris 710f54a44e remove unused import
2024-01-12 21:46:54 +00:00
..
bfs_dirtrav.py reword 2024-01-12 12:32:53 +00:00
dfs_dirtrav.py remove unused import 2024-01-12 21:46:54 +00:00
README.md add note to readme 2024-01-12 13:33:29 +00:00

README.md

BFS DFS on rooted tree (connected acyclic graph)

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.

Note. DFS cannot be used to find the shortest path. In the mango seller example, a DFS search may have found a second or third degree seller before a first. However, DFS may be used to find the topological sort.