Consider the following statements about the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE?
https://books.google.co.in/books?id=M-mhFtxaaskC&pg=PA385&dq=The+cyclomatic+complexity+of+a+module+is+equal+to+the+maximum+number+of+linearly+independent+circuits+in+the+graph.&hl=en&sa=X&ved=0ahUKEwjn8vufws_oAhVkwTgGHfTMCagQuwUILTAA#v=onepage&q=The%20cyclomatic%20complexity%20of%20a%20module%20is%20equal%20to%20the%20maximum%20number%20of%20linearly%20independent%20circuits%20in%20the%20graph.&f=false
Please check this link of book software engineering by pankaj jalote it says 1st statement is also true. Kindly check and update the answer.
NOTE: the decision node should have only 2 paths one for yes and one for no to use this formula.
the first statement is also true please check this link of book software engineering by pankaj https://books.google.co.in/books?id=M-mhFtxaaskC&pg=PA385&dq=The+cyclomatic+complexity+of+a+module+is+equal+to+the+maximum+number+of+linearly+independent+circuits+in+the+graph.&hl=en&sa=X&ved=0ahUKEwjU4pKk2NDoAhW8zjgGHS1bBjUQ6AEIJTAA#v=onepage&q=The%20cyclomatic%20complexity%20of%20a%20module%20is%20equal%20to%20the%20maximum%20number%20of%20linearly%20independent%20circuits%20in%20the%20graph.&f=false
64.3k questions
77.9k answers
243k comments
79.7k users