METHODOLOGY OF USING DEPTH-FIRST SEARCH (DFS) FOR SOLVING PROGRAMMING COMPETITION PROBLEMS

Depth First Search (DFS) is a well-known method for traversing a graph. In various situations, particularly in competition problems, the need for an effective application of DFS is masked by the conditions of the problem, or the data structures used. In these cases, the problem is either to identify the need to use DFS in the solution or to adapt the DFS to the particular conditions of the problem. This article is a study of representative competition problems, with the identification of DFS solutions, accompanied by IT solutions. The results will be useful to all those who are passionate about competitive programming, but also to those who study graph algorithms.