https://github.com/hxndev/graph-based-dfs
Depth-first search (DFS) is an algorithm for searching a tree data structure that searches the tree vertically. It will explore one branch to the root node followed by the next branch.
https://github.com/hxndev/graph-based-dfs
code depth-first-search dfs dfs-algorithm dfs-search graph lab python
Last synced: 8 months ago
JSON representation
Depth-first search (DFS) is an algorithm for searching a tree data structure that searches the tree vertically. It will explore one branch to the root node followed by the next branch.
- Host: GitHub
- URL: https://github.com/hxndev/graph-based-dfs
- Owner: HxnDev
- License: mit
- Created: 2021-07-27T06:24:29.000Z (over 4 years ago)
- Default Branch: main
- Last Pushed: 2021-07-27T06:26:54.000Z (over 4 years ago)
- Last Synced: 2025-03-31T10:41:10.796Z (10 months ago)
- Topics: code, depth-first-search, dfs, dfs-algorithm, dfs-search, graph, lab, python
- Language: Python
- Homepage:
- Size: 58.6 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: Readme.md
- License: LICENSE
Awesome Lists containing this project
README
All the files have been commented for your ease. Furthermore you may also add further comments if you may.
For further queries contact me at : chhxnshah@gmail.com