Algorithms, Depth First Search, Breadth First Search, Graph, Data Structures.
classical graph processing algorithm, used for traversing or searching a graph or tree data structure(a graph without any cycles can be thought of as an tree). The idea is pretty simple, we arbitrarily select a vertex in a graph and then we visit it’s neighboring vertices. Continue this process