使用深度优先搜索(dfs)解决编程竞赛问题的方法学

S. Corlat, Roxana Mehryar-Rad
{"title":"使用深度优先搜索(dfs)解决编程竞赛问题的方法学","authors":"S. Corlat, Roxana Mehryar-Rad","doi":"10.36120/2587-3636.v26i4.109-118","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":431984,"journal":{"name":"Acta et commentationes: Științe ale Educației","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"METHODOLOGY OF USING DEPTH-FIRST SEARCH (DFS) FOR SOLVING PROGRAMMING COMPETITION PROBLEMS\",\"authors\":\"S. Corlat, Roxana Mehryar-Rad\",\"doi\":\"10.36120/2587-3636.v26i4.109-118\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":431984,\"journal\":{\"name\":\"Acta et commentationes: Științe ale Educației\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta et commentationes: Științe ale Educației\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.36120/2587-3636.v26i4.109-118\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta et commentationes: Științe ale Educației","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.36120/2587-3636.v26i4.109-118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

深度优先搜索(Depth First Search, DFS)是一种众所周知的遍历图的方法。在各种情况下,特别是在竞争问题中,对DFS有效应用的需求被问题的条件或所使用的数据结构所掩盖。在这些情况下,问题要么是确定是否需要在解决方案中使用DFS,要么是使DFS适应问题的特定条件。本文研究了具有代表性的竞争问题,确定了DFS解决方案,并附带了IT解决方案。这些结果对所有热衷于竞争性编程的人都很有用,对那些研究图算法的人也很有用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信