QuestionQ14Verified/Testing in AgileCopy linkReport a problemAsk AstroTutorSave questionWhich of the following provides a valid method for calculating cyclomatic complexity?ANumber of decisions + 2BNumber of enclosed regions - 1CNumber of statements - 2DLinks - Nodes + 2Show AnswerAnswerExplanationFor a connected control-flow graph, cyclomatic complexity is calculated as the number of links (edges) minus the number of nodes plus 2: E − N + 2.Show comments0Show commentsCommunity DiscussionNo comments yet. Be the first to start the discussion!
Community Discussion