| Vorderseite | cyclomatic complexity |
|---|---|
| Rückseite | The maximum number of linear, independent paths through a program. Cyclomatic complexity may be computed as: L ? N + 2P, where L = the number of edges/links in a graph N = the number of nodes in a graph P = the number of disconnected parts of the graph (e.g. a called graph or subroutine) [After McCabe] |
Learn with these flashcards. Click next, previous, or up to navigate to more flashcards for this subject.
Next card: Cyclomatic number complexity see
Previous card: Coverage branch percentage exercised test case suite implies
Up to card list: ISTQB Glossary of Terms in Software testing