Lecture overview -- Keyboard shortcut: 'u'  Previous page: Cyclomatic Complexity - flow chart -- Keyboard shortcut: 'p'  Next page: Cyclomatic Complexity - Metric and Test Cases -- Keyboard shortcut: 'n'  Lecture notes - all slides together  Annotated slide -- Keyboard shortcut: 't'  Textbook -- Keyboard shortcut: 'v'  Alphabetic index  Help page about these notes  Course home    Test of Object-oriented Programs - slide 11 : 35

Cyclomatic Complexity - flow graph
A slight abstraction of the flow chart leads to a so-called flow graph
 

A, r A, X, B, C, Y, p, q, A, r
A, X, B, C, Z, p, q, A, r A, X, B, V, W, q, A, r