cyclomatic complexity
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]
Subscribe to:
Post Comments (Atom)
This is a great article on different software development blogs available. Whilst there is a lot of content, there are some awesome developers that are also worth. I'd also recommending keeping an eye on these Yiioverflow software developers for Nodejs, Angualr, Ionic, ReactJS and Yiiframework
ReplyDelete