Question 7
Consider the following statements regarding structural graph coverage criteria, and choose the correct option. i) Prime paths are maximal simple paths. ii) Edge-pair coverage does not require self-loops to be visited. iii) Test paths to achieve node and edge coverage can be obtained by simple modifications to BFS algorithm over graphs.
Statement i) and iii) are correct. Statement ii) is incorrect.
Statement i) is correct. Statement ii) and iii) are incorrect.
Statement ii) and iii) are correct. Statement i) is incorrect.
Statement i) and ii) are correct. Statement iii) is incorrect.