OLGKAD / sef18group15-coverage

Algorithms and Data Structures implemented in Java
Apache License 2.0
0 stars 0 forks source link

compute CC of BinarySearchTree<T::getDFS and document the purpose of each branch (in comments) #2

Open OLGKAD opened 6 years ago

pwnttm commented 6 years ago

Calculated the CC by counting every point that invloved decision making such as if else if and && clauses. the number of such points were 22 with 1 exit point this equates to 22-1+2 = 23 (proof of work on paper can be provided later if needed)