Automation Of Independent Path Searching using Depth First Search
In a basis path testing, there are independent paths that must be passed/tested at least once to make sure there are no errors in the code and ensure all pseudocode have implemented on the code. Previously, the independent path was generated using the Genetic Algorithm, but the number of iterations...
Main Authors: | Achmad Arwan, Denny Sagita |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Brawijaya
2018-09-01
|
Series: | JITeCS (Journal of Information Technology and Computer Science) |
Online Access: | http://jitecs.ub.ac.id/index.php/jitecs/article/view/62 |
Similar Items
-
Persistent search: a bridge between depth-first and breadth-first search for physical agents.
by: Mayer, Michael McClanahan.
Published: (2013) -
Variations on Multi-Core Nested Depth-First Search
by: Alfons Laarman, et al.
Published: (2011-10-01) -
Comparison of Decisions Quality of Heuristic Methods with Limited Depth-First Search Techniques in the Graph Shortest Path Problem
by: Vatutin Eduard
Published: (2017-12-01) -
Differential equations and depth first search for enumeration of maps in surfaces
by: Brown, Daniel R. L.
Published: (2006) -
Differential Equations and Depth First Search for Enumeration of Maps in Surfaces
by: Brown, Daniel
Published: (2006)