Algorithms, Data Structures, DFS, Bfs, Graphs.
0); Depth-first search This one is pretty similar to the first one. The only difference it goes in-depth to put the next nodes in the queue. DFS explores as far as possible along each branch before backtracking. It goes deep into the graph before exploring the neighbours of a node. It can be