Elementary Combinatorial Algorithms
Baha M. Alzalg · Zenodo (CERN European Organization for Nuclear Research) · 2022
In this book chapter, we present elementary algorithms for searching and exploring a graph. Our focus is on the following searching algorithms: The breadth-first search and the depth-first search. Before this, we learn how to represent a graph in a way that we can use such a representation as an input for the searching algorithm.