Algorithms, Depth First Search, Breadth First Search, Graph, Data Structures.
source vertex Find a path between two vertices Flood fill(Photoshop magic wand). Breadth-First Search: BFS is another classical graph processing algorithm, similar to DFS it is used for traversing or searching a tree or graph data structure. The objective of a BFS algorithm is similar to that of