Open AccessMETHODOLOGY OF USING DEPTH-FIRST SEARCH (DFS) FOR SOLVING PROGRAMMING COMPETITION PROBLEMS
Author(s) -
Sergiu Corlat,
Roxana Mehryar-Rad
Publication year - 2022
Publication title -
acta et commentationes: ştiinţe ale educaţiei
Language(s) - English
Resource type - Journals
eISSN - 2587-3636
pISSN - 1857-0623
DOI - 10.36120/2587-3636.v26i4.109-118
Subject(s) - distributed file system , traverse , graph , competition (biology) , breadth first search , computer science , mathematics , mathematical optimization , theoretical computer science , algorithm , geography , biology , cartography , ecology , computer security
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.