N-switch coverage measures test coverage in terms of sequences of N+1 consecutive transitions (N switches) traversed through a state diagram, and the theoretical maximum achievable switch level for a given diagram is capped by the longest chain of consecutive, validly connected transitions that the diagram's states and transitions actually permit — a diagram cannot be exercised to a switch level beyond the deepest transition chain its structure supports, and for this diagram that ceiling is six.
Community Discussion