Breadth and depth first search implementation in CSharp - part 1

The idea behind search algorithms is to simulate the exploration of a space of states or search space through the generation of successor states already explored. The search space can be explored in different orders for instance level by level (Breadth-first search) or reaching a leaf node first and backtracking (Depth-first search).