Skip to content

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.

License

Notifications You must be signed in to change notification settings

HxnDev/Graph-Based-DFS

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 

Repository files navigation

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

About

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.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages