Reasons on the implication of testing (Cyclomatic Complexity)
The word “cyclomatic” comes from the number of fundamental (or basic) cycles in connected,undirected graphs [BERGE]. More importantly, it also gives the number of independent paths through strongly connected directed graphs. A strongly connected graph is one in
which each node can be reached from any other node by following directed edges in the graph. Program control flow
graphs are not strongly connected, but they become strongly connected when a “virtual edge” is added connecting the exit node to the entry node. The cyclomatic complexity definition for avoids explicit mention of the virtual edge.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment