docs(intro): reword some sentences for clarity

rubik · Nov 13, 2014 · 7b9712a · 7b9712a
1 parent d94e862
commit 7b9712a
Showing 1 changed file with 3 additions and 2 deletions.
diff --git a/docs/intro.rst b/docs/intro.rst
@@ -10,8 +10,8 @@ Cyclomatic Complexity
 
 Cyclomatic Complexity corresponds to the number of decisions a block of code
 contains plus 1. This number (also called McCabe number) is equal to the number
-of possible paths through the code. It is therefore equivalent to the number of
-test cases it should take to completely cover the block.
+of linearly indipendent paths through the code. This number can be used as a
+guide when testing conditional logic in blocks.
 
 Radon analyzes the AST tree of a Python program to compute Cyclomatic
 Complexity. Statements have the following effects on Cyclomatic Complexity:
@@ -33,6 +33,7 @@ Complexity. Statements have the following effects on Cyclomatic Complexity:
  Boolean Operator   +1             Every boolean operator (and, or) adds a decision point.
 ================== ============== ===========================================================================================
 
+
 Maintainability Index
 ---------------------