📄️ Breadth First Search
Breadth-first search is a graph traversal algorithm that explores all the vertices of a graph at the same level before moving to the next level, ensuring the shortest path to each vertex is discovered first.
📄️ Depth First Search
Depth First Search is a graph traversal algorithm that explores as far as possible along each branch before backtracking.