循環的複雑度
1. Cyclomatic complexityCyclomatic complexity (or conditional complexity) is a software metric (measurement). It was developed by Thomas J. McCabe, Sr. in 1976 and is used to indicate the complexity of a program. It directly measures the number of linearly independent paths through a program's source code. The concept, although not the method, is somewhat similar to that of general text complexity measured by the Flesch-Kincaid Readability Test.
Read “Cyclomatic complexity” on English Wikipedia
Read “循環的複雑度” on Japanese Wikipedia
Read “Cyclomatic complexity” on DBpedia
Read “Cyclomatic complexity” on English Wikipedia
Read “循環的複雑度” on Japanese Wikipedia
Read “Cyclomatic complexity” on DBpedia
Discussions
Log in to talk about this word.