“…Graph algorithms [2,29,38,58,33,56,39,72,53,11,40,48,57,41,43,45,55,59,37,62,50,35,52,36,31,47,32,60] 28 [42] proposed a technique to generate all the unique paths in the activity graph (derived from an AD) by covering all the edges and then using a GA to obtain the best test cases. Similarly, Mahali and Acharya [45] proposed an approach to generate all test paths using DFS and then to employ a GA to prioritize them.…”