If the value of cyclomatic complexity is less (a value less than or equal to 10 is considered awesome), the code is assumed to be well structured, highly testable and maintainable. ![]() Since cyclomatic complexity indicates the linerly independent paths though the program, the more the value of cyclomatic complexity, the more the number of test cases you would need for your program - the number of test cases you would need would typically be equivalent to the cyclomatic complexity in this case. You can take advantage of cyclomatic complexity to calculate the complexity of methods, types and also modules in your application. Incidentally, the lower the value of cyclomatic complexity of a method, the easier it is to test and maintain, hence the better. Note that a node represents the logical branch and an edge represents the connected line between the nodes. N denotes the number of nodes in the graph E denotes the number of edges in the graph
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |