The graph theoretic concept will be useful in software testing is
Option A seems right because cyclomatic complexity(aka Nullity or first Betti number) measures the no of closed regions in a planar graph
64.3k questions
77.9k answers
244k comments
80.0k users