Search
3 articles for “Depth First Search”
-
A Hybrid Approach for Test Path Generation and Prioritization using Depth First Search and Tabu Search Algorithm
Abstract: Software testing is one of the main phases of Software Development Life Cycle (SDLC). Software testing is used to reduce errors, reduce software cost and ensure the quality of the software. To ensure the correctness of the software, generation of test cases is the most important issue in software testing. Test cases can be derived from Unified Modelling Language (UML) models more efficiently. During test case development, there might be …
Published in Journal of Software Engineering Tools & Technology Trends · Vol. 2, Issue 2, 2015 · pp. 7–20 Read article
-
Applications of Depth-First Search
Abstract: AbstractIn this paper, various applications of depth-first search algorithms (DFS) are surveyed. The value of DFS or “Backtracking” as a technique for solving problem is illustrated by many applications such as cycle detection, strongly connected components, topological sort, and find articulation point in a graph. The time complexity in different applications of DFS is also summarized.Keywords: depth-first search, articulation point, strongly connected component, detecting cycle, graph, topological sort, railway rescheduling
Published in Journal of Computer Technology & Applications · Vol. 4, Issue 2, 2013 · pp. 1–9 Read article
-
Traversal Speed Comparison of BFS and DFS in Balanced and Skewed Binary Trees
Abstract: In this paper, we provide an analysis of how well both breadth-first search (BFS) and depth-first search (DFS) algorithms perform while wandering through two kinds of binary trees: balanced and skewed. The research was motivated by the practical application of storing files and directories in a certain type of parent-child relationship through the use of hierarchical file systems (e.g., windows explorer). The result of measuring how fast and versatilely these …
Published in International Journal of Data Structure Studies · Vol. 4, Issue 2, 2026 Read article