Optimal Path Sequencing In Basis Path Testing
Software testing is one of the most important phases in SDLC and is widely used for testing the functional and
structural behavior of software. White-box testing or structural testing is typically based on the source code and flow of
control in the graph i.e. effective path or optimal path. Aim of this paper is to put forward an approach for the identification
of effective paths in control flow graph for software under test and prioritizing the most feasible path to be executed first
using ant colony optimization algorithm. We will be using control flow graph (CFG) to generate optimal paths and
Cyclomatic Complexity for finding the number of feasible paths. The example will show the effectiveness of the algorithm.