What are DFS(Depth First Search) and BFS(Breadth First Search) algorithms ?

[aked21]

[MJinH]

excited to learn about DFS and BFS

[MJinH]

I believe DFS (Depth First Search) is a technique for traversing data in graphs and it uses stack data structure. The DFS is usually a recursive algorithm and it pushes the first visited vertices into the stack and if the next vertex does not exist, then the vertices in the stack are popped. Whereas BFS (Breadth First Search) is a technique for traversing the shortest path in graphs and it uses queue data structure.

[shinhanbyeol]

Here's some useful information. https://adrianmejia.com/data-structures-for-beginners-graphs-time-complexity-tutorial/